Der Kartendienst OpenStreetMap ist einer der beliebtesten Anbieter für OpenData-Karten. Diese Karten konzentrieren sich jedoch derzeitig auf Außenraumumgebungen, da sich bereits existierende Ansätze zur Innenraumkartografierung nicht durchsetzen konnten. Als einer der Hauptgründe wird die mangelnde Unterstützung der verbreiteten Karteneditoren angesehen. Die vorliegende Bachelorarbeit befasst sich daher mit der Implementierung eines Plug-Ins für die Erstellung von Innenraumkarten im Editor „JOSM“, und dem Vergleich des Arbeitsaufwandes zur Innenraumkartenerstellung mit und ohne diesem Hilfsmittel.

Hachures in Digital Cartography Abstract This thesis deals with the possibilities of creating hachures, especially slope and shadow, in digital cartography. First part focuses on utilization of hachures and its construction in classic cartography. The rules that should be observed by the mapmaker are described. In the next section are delineated the current possibilities how to create hachures in digital cartography. The existing algorithms are evaluated. On the basis of the rules and research of literature is designed own methodology. Emphasis is put on automation using digital terrain model. The work as well contains testing the algorithm on the real data. Key words: hachures, digital cartography, hypsography

Algorithm for automated building simplification using aggregation Abstract Diploma thesis deals with automated cartographic generalization. The main aim is to propose a new generalization algorithm for building aggregation. The first part brings summary of existing algorithms for building aggre- gation. Then the new algorithm is presented: at first, auxiliary data structu- res and algorithms are presented, then cartographic and geometric require- ments are defined. New algorithm is based on the principle of straight skeleton construction. Outer vertices are removed from constructed straight skeletons and those structures are aggregated. The aggregated polygon is reconstructed from ag- gregated structures. The second part is focused on implementation and results evaluation. The algorithm is implemented using open-source libraries CGAL, Boost and Shapelib. The results and confrontation with SW ArcGIS are discus- sed in conclusion of the thesis. 1

No description available.

This master thesis is focused on cartography generalization of a rivers using collapse and partial collapse method with the usage of straight skeleton data structure. The proposed method was designed for large scale maps in geographical view and for medium scale maps in cartographic view (till 1 : 100 000). The thesis is focusing on width of a river as stand alone criteria for generalization decision. The presented solution represents set of a criteria which decides on generalization of a river. The presented thesis also solves problematic situations that exist on a river such as islands, junctions, shoulders or bifurcation. The thesis also includes proposed generalization algorithm which is using straight skeleton data structure. The algorithm is implemented in C++ programming language in Microsoft Visual Studio IDE. The algorithm uses external libraries Qt and CGAL (Computational Geometry Algorithms Library) for functioning. Algorithm results are saved in ESRI geodatabase with the usage of Python 2.7 programming language and external library ArcPy. Water areas from ZABAGED were chosen as appropriate data for testing. Achieved results of generalization are presented on test data for various scales and they are compared with base maps of Czech Republic. Keywords: digital cartography, cartography...

The principal aim of this master´s thesis has been to analyze the available Czech and foreign cartographic works that may be used wholly or partly for preschool children. A design and a model of an orientation map of a village for educational needs in nursery schools and the first stage of primary schools are part of the work. A basic map of the village of Boretice (a disctrict of Breclav) has been used as a basis for creation of my own design of a map. The usability of the newly designed map has been tested in the local nursery school.

Maps are the main tool to represent geographical information. Geographical information is usually scale-dependent, so users need to have access to maps at different scales. In our digital age, the access is realized by zooming. As discrete changes during the zooming tend to distract users, smooth changes are preferred. This is why some digital maps are trying to make the zooming as continuous as they can. The process of producing maps at different scales with smooth changes is called continuous map generalization. In order to produce maps of high quality, cartographers often take into account additional requirements. These requirements are transferred to models in map generalization. Optimization for map generalization is important not only because it finds optimal solutions in the sense of the models, but also because it helps us to evaluate the quality of the models. Optimization, however, becomes more delicate when we deal with continuous map generalization. In this area, there are requirements not only for a specific map but also for relations between maps at difference scales. This thesis is about continuous map generalization based on optimization. First, we show the background of our research topics. Second, we find optimal sequences for aggregating land-cover areas. We compare the A$^{\!\star}$\xspace algorithm and integer linear programming in completing this task. Third, we continuously generalize county boundaries to provincial boundaries based on compatible triangulations. We morph between the two sets of boundaries, using dynamic programming to compute the correspondence. Fourth, we continuously generalize buildings to built-up areas by aggregating and growing. In this work, we group buildings with the help of a minimum spanning tree. Fifth, we define vertex trajectories that allow us to morph between polylines. We require that both the angles and the edge lengths change linearly over time. As it is impossible to fulfill all of these requirements simultaneously, we mediate between them using least-squares adjustment. Sixth, we discuss the performance of some commonly used data structures for a specific spatial problem. Seventh, we conclude this thesis and present open problems. / Maps are the main tool to represent geographical information. Users often zoom in and out to access maps at different scales. Continuous map generalization tries to make the changes between different scales smooth, which is essential to provide users with comfortable zooming experience. In order to achieve continuous map generalization with high quality, we optimize some important aspects of maps. In this book, we have used optimization in the generalization of land-cover areas, administrative boundaries, buildings, and coastlines. According to our experiments, continuous map generalization indeed benefits from optimization. / Landkarten sind das wichtigste Werkzeug zur Repräsentation geografischer Information. Unter der Generalisierung von Landkarten versteht man die Aufbereitung von geografischen Informationen aus detaillierten Daten zur Generierung von kleinmaßstäbigen Karten. Nutzer von Online-Karten zoomen oft in eine Karte hinein oder aus einer Karte heraus, um mehr Details bzw. mehr Überblick zu bekommen. Die kontinuierliche Generalisierung von Landkarten versucht die Änderungen zwischen verschiedenen Maßstäben stetig zu machen. Dies ist wichtig, um Nutzern eine angenehme Zoom-Erfahrung zu bieten. Um eine qualitativ hochwertige kontinuierliche Generalisierung zu erreichen, kann man wichtige Aspekte bei der Generierung von Online-Karten optimieren. In diesem Buch haben wir Optimierung bei der Generalisierung von Landnutzungskarten, von administrativen Grenzen, Gebäuden und Küstenlinien eingesetzt. Unsere Experimente zeigen, dass die kontinuierliche Generalisierung von Landkarten in der Tat von Optimierung profitiert.

This thesis deals with methods of cartographic representation, namely methods of cartographic presentation of socio-economical and natural phenomena in the administrative district of the municipality with extended power Trhové Sviny. The theoretical part is devoted to the general principles of map creating, their composition and the description of basic cartographic means of expression and particular methods of cartographic display of the thematic content. The practical part then describes the sequence of particular operations on whose basis the map file with the given theme is created.

Georg Öder der Jüngere (II.) und dessen gleichnamiger Sohn verkörperten im ausgehenden 16. Jahrhundert als kurfürstliche Markscheider das amtliche Vermessungswesen Sachsens. Georg Öder II. erscheint im Zusammenhang mit seinen Vermessungen der landesherrlichen Wälder und Jagden Sachsens als Initiator einer kartographischen Tradition, die schließlich von seinen Söhnen fortgesetzt wurde. Zentrale Werke, die bisher Georg Öder II. zugeschrieben wurden, können als Arbeiten seines Sohnes Georg Öders III. herausgestellt werden. Dazu zählen die Forstzeichenbücher und die damit verbundenen Kartierungen der kurfürstlichen Waldungen, mit denen Georg Öder III. wichtige Impulse zur Entwicklung der kursächsischen Vermessungskartographie beisteuerte.

Der Kartendienst OpenStreetMap ist einer der beliebtesten Anbieter für OpenData-Karten. Diese Karten konzentrieren sich jedoch derzeitig auf Außenraumumgebungen, da sich bereits existierende Ansätze zur Innenraumkartografierung nicht durchsetzen konnten. Als einer der Hauptgründe wird die mangelnde Unterstützung der verbreiteten Karteneditoren angesehen. Die vorliegende Bachelorarbeit befasst sich daher mit der Implementierung eines Plug-Ins für die Erstellung von Innenraumkarten im Editor „JOSM“, und dem Vergleich des Arbeitsaufwandes zur Innenraumkartenerstellung mit und ohne diesem Hilfsmittel.