Centre de documentation
scientifique

Automating the external placement of symbols for point features in situation maps for emergency response / Sven Gedicke in Cartography and Geographic Information Science, Vol 50 n° 4 (June 2023)  

Public [article]  inCartography and Geographic Information Science > Vol 50 n° 4 (June 2023) . - pp 385 - 402 Titre : Automating the external placement of symbols for point features in situation maps for emergency response Type de document : Article/Communication Auteurs : Sven Gedicke, Auteur ; Lukas Arzoumanidis, Auteur ; Jan‐Henrik Haunert, Auteur Année de publication : 2023 Article en page(s) : pp 385 - 402 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] algorithme du recuit simulé [Termes IGN] cartographie d'urgence [Termes IGN] optimisation (mathématiques) [Termes IGN] placement automatique des signes conventionnels [Termes IGN] programmation linéaire Résumé : (auteur) In this article, we address the time-critical work of emergency services in the field of disaster and emergency response. Aiming at saving valuable human and time resources during emergency operations, we present one exact and one heuristic approach for the automatic placement of tactical symbols in situation maps. Such maps are used to establish situational awareness and to convey mission-relevant information to emergency personnel. Usually, the information is communicated through the visualization of descriptive symbols which are predominantly placed in a manual process. We automate this process based on an established map layout used by emergency services in Germany that distributes the symbols to the map boundaries. Following general principles and observations from existing literature, we formalize the symbol placement as an optimization problem. We take into account the relevance of tactical symbols as well as short and crossing-free leaders and allow the grouped representation of symbols of similar semantics and spatially close map locations. In experiments with real-world data, we determine a balance between the optimization criteria and show that our heuristic generates high-quality results in less than a second. In an assessment by an expert, we get confirmation that our maps are suitable for use in emergency scenarios. Numéro de notice : A2023-234 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/15230406.2023.2213446 Date de publication en ligne : 20/06/2023 En ligne : https://doi.org/10.1080/15230406.2023.2213446 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=103592 [article]

Aggregating land-use polygons considering line features as separating map elements / Sven Gedicke in Cartography and Geographic Information Science, vol 48 n° 2 (March 2021)  

Public [article]  inCartography and Geographic Information Science > vol 48 n° 2 (March 2021) . - pp 124 - 139 Titre : Aggregating land-use polygons considering line features as separating map elements Type de document : Article/Communication Auteurs : Sven Gedicke, Auteur ; Johannes Oehrlein, Auteur ; Jan‐Henrik Haunert, Auteur Année de publication : 2021 Article en page(s) : pp 124 - 139 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] agrégation spatiale [Termes IGN] algorithme du recuit simulé [Termes IGN] généralisation cartographique automatisée [Termes IGN] méthode heuristique [Termes IGN] optimisation (mathématiques) [Termes IGN] réseau routier [Termes IGN] utilisation du sol [Vedettes matières IGN] Généralisation Résumé : (Auteur) Map generalization is the process of deriving small-scale target maps from a large-scale source map or database while preserving valuable information. In this paper we focus on topographic data, in particular areas of different land-use classes and line features representing the road network. When reducing the map scale, some areas need to be merged to larger composite regions. This process is known as area aggregation. Given a planar partition of areas, one usually aims to build geometrically compact regions of sufficient size while keeping class changes small. Since line features (e.g. roads) are perceived as separating elements in a map, we suggest integrating them into the process of area aggregation. Our aim is that boundaries of regions coincide with line features in such a way that strokes (i.e. chains of line features with small angles of deflection) are not broken into short sections. Complementing the criteria of compact regions and preserving land-use information, we consider this aim as a third criterion. Regarding all three criteria, we formalize an optimization problem and solve it with a heuristic approach using simulated annealing. Our evaluation is based on experiments with different parameter settings. In particular, we compare results of a baseline method that considers two criteria, namely compactness and class changes, with results of our new method that additionally considers our stroke-based criterion. Our results show that this third criterion can be substantially improved while keeping the quality with respect to the original two criteria on a similar level. Numéro de notice : A2021-180 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/15230406.2020.1851613 Date de publication en ligne : 26/01/2021 En ligne : https://doi.org/10.1080/15230406.2020.1851613 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97067 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
032-2021021	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Map matching for semi-restricted trajectories / Timon Behr (2021)  

Public Titre : Map matching for semi-restricted trajectories Type de document : Article/Communication Auteurs : Timon Behr, Auteur ; Thomas van Dijk, Auteur ; Axel Forsch, Auteur ; Jan‐Henrik Haunert, Auteur ; Sabine Storandt, Auteur Editeur : Leibniz [Allemagne] : Schloss Dagstuhl – Leibniz-Zentrum für Informatik Année de publication : 2021 Conférence : GIScience 2021, 11th International Conference on Geographic Information Science 27/09/2021 30/09/2021 Poznań Pologne Open Access Proceedings Importance : 16 p. Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] appariement de cartes [Termes IGN] cycliste [Termes IGN] information sémantique [Termes IGN] OpenStreetMap [Termes IGN] piéton [Termes IGN] positionnement par GPS [Termes IGN] réseau routier [Termes IGN] trajet (mobilité) Résumé : (auteur) We consider the problem of matching trajectories to a road map, giving particular consideration to trajectories that do not exclusively follow the underlying network. Such trajectories arise, for example, when a person walks through the inner part of a city, crossing market squares or parking lots. We call such trajectories semi-restricted. Sensible map matching of semi-restricted trajectories requires the ability to differentiate between restricted and unrestricted movement. We develop in this paper an approach that efficiently and reliably computes concise representations of such trajectories that maintain their semantic characteristics. Our approach utilizes OpenStreetMap data to not only extract the network but also areas that allow for free movement (as e.g. parks) as well as obstacles (as e.g. buildings). We discuss in detail how to incorporate this information in the map matching process, and demonstrate the applicability of our method in an experimental evaluation on real pedestrian and bicycle trajectories. Numéro de notice : C2021-081 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Communication DOI : 10.4230/LIPIcs.GIScience.2021.II.12 Date de publication en ligne : 14/09/2021 En ligne : https://doi.org/10.4230/LIPIcs.GIScience.2021.II.12 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=100939

Extracting spatial patterns in bicycle routes from crowdsourced data / Jody Sultan in Transactions in GIS, vol 21 n° 6 (December 2017)  

Public [article]  inTransactions in GIS > vol 21 n° 6 (December 2017) . - pp 1321 - 1340 Titre : Extracting spatial patterns in bicycle routes from crowdsourced data Type de document : Article/Communication Auteurs : Jody Sultan, Auteur ; Gev Ben‐Haim, Auteur ; Jan‐Henrik Haunert, Auteur ; Sagi Dalyot, Auteur Année de publication : 2017 Article en page(s) : pp 1321 - 1340 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] Amsterdam (Pays-Bas) [Termes IGN] cycliste [Termes IGN] données localisées des bénévoles [Termes IGN] extraction de modèle [Termes IGN] trace GPS [Termes IGN] trajet (mobilité) Résumé : (auteur) Much is done nowadays to provide cyclists with safe and sustainable road infrastructure. Its development requires the investigation of road usage and interactions between traffic commuters. This article is focused on exploiting crowdsourced user‐generated data, namely GPS trajectories collected by cyclists and road network infrastructure generated by citizens, to extract and analyze spatial patterns and road‐type use of cyclists in urban environments. Since user‐generated data shows data‐deficiencies, we introduce tailored spatial data‐handling processes for which several algorithms are developed and implemented. These include data filtering and segmentation, map‐matching and spatial arrangement of GPS trajectories with the road network. A spatial analysis and a characterization of road‐type use are then carried out to investigate and identify specific spatial patterns of cycle routes. The proposed analysis was applied to the cities of Amsterdam (The Netherlands) and Osnabrück (Germany), proving its feasibility and reliability in mining road‐type use and extracting pattern information and preferences. This information can help users who wish to explore friendlier and more interesting cycle patterns, based on collective usage, as well as city planners and transportation experts wishing to pinpoint areas most in need of further development and planning. Numéro de notice : A2017-838 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12280 Date de publication en ligne : 06/06/2017 En ligne : https://doi.org/10.1111/tgis.12280 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=89374 [article]

A symmetry detector for map generalization and urban-space analysis / Jan‐Henrik Haunert in ISPRS Journal of photogrammetry and remote sensing, vol 74 (Novembrer 2012)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 74 (Novembrer 2012) . - pp 66 - 77 Titre : A symmetry detector for map generalization and urban-space analysis Type de document : Article/Communication Auteurs : Jan‐Henrik Haunert, Auteur Année de publication : 2012 Article en page(s) : pp 66 - 77 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] agrégation de détails [Termes IGN] analyse spatiale [Termes IGN] bati [Termes IGN] Boston (Massachusetts) [Termes IGN] données vectorielles [Termes IGN] empreinte [Termes IGN] généralisation cartographique automatisée [Termes IGN] polygone [Termes IGN] simplification de contour [Vedettes matières IGN] Généralisation Résumé : (Auteur) This article presents an algorithmic approach to the problem of finding symmetries in building footprints, which is motivated by map generalization tasks such as symmetry-preserving building simplification and symmetry-aware grouping and aggregation. Moreover, symmetries in building footprints may be used for landmark selection and building classification. The presented method builds up on existing methods for symmetry detection in vector data that use algorithms for string matching. It detects both mirror symmetries and repetitions of geometric structures. In addition to the existing vector-based methods, the new method finds partial symmetries in polygons while allowing for small geometric errors and, based on a least-squares approach, computes optimally adjusted mirror axes and assesses their quality. Finally, the problem of grouping symmetry relations is addressed with an algorithm that finds mirror axes that are almost collinear. The presented approach was tested on a large building dataset of the metropolitan Boston area and its results were compared with results that were manually generated in an empirical test. The symmetry relations that the participants of the test considered most important were found by the algorithm. Future work will deal with the integration of information on symmetry relations into algorithms for map generalization. Numéro de notice : A2012-604 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2012.08.004 En ligne : https://doi.org/10.1016/j.isprsjprs.2012.08.004 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32050 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
081-2012081	SL	Revue	Centre de documentation	Revues en salle	Disponible

Map generalisation / Jan‐Henrik Haunert in GIM international, vol 25 n° 1 (January 2011)

Permalink

Area aggregation in map generalisation by mixed-integer programming / Jan‐Henrik Haunert in International journal of geographical information science IJGIS, vol 24 n°11-12 (december 2010)  

Permalink