Descripteur
Termes IGN > cartographie > conception cartographique > généralisation cartographique > simplification de contour
simplification de contourSynonyme(s)Simplification de ligne |
Documents disponibles dans cette catégorie (87)
Ajouter le résultat dans votre panier
Visionner les documents numériques
Affiner la recherche Interroger des sources externes
Etendre la recherche sur niveau(x) vers le bas
SELF: Semantically Enriched Line simpliFication / Emmanuel Stefanakis in International journal of geographical information science IJGIS, vol 29 n° 10 (October 2015)
[article]
Titre : SELF: Semantically Enriched Line simpliFication Type de document : Article/Communication Auteurs : Emmanuel Stefanakis, Auteur Année de publication : 2015 Article en page(s) : pp 1826 - 1844 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] attribut sémantique
[Termes IGN] extension temporelle
[Termes IGN] généralisation cartographique automatisée
[Termes IGN] polyligne
[Termes IGN] représentation cartographique
[Termes IGN] simplification de contour
[Termes IGN] système d'extension spatialRésumé : (Auteur) Linear features are represented on paper or digital maps with polyline geometries. Sampling, discretization, and generalization processes result in polylines of a length smaller than that of the actual features. In addition, semantics associated to the original line features may be lost. This becomes more significant for coarse sampling and/or high degree of generalization. This paper introduces a data structure that can alleviate this problem, by preserving the attributes and semantic characteristics associated to the original features in cartographic representation. The structure can handle both linear features and polygon outlines. Various compression methods have been examined. The structure has been implemented and tested with both synthetic and real datasets. Extensions to spatiotemporal features, like trajectories, have also been considered. Numéro de notice : A2015-611 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2015.1053092 En ligne : https://doi.org/10.1080/13658816.2015.1053092 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=78041
in International journal of geographical information science IJGIS > vol 29 n° 10 (October 2015) . - pp 1826 - 1844[article]Automatic construction of 3-D building model from airborne LIDAR data through 2-D snake algorithm / Jianhua Yan in IEEE Transactions on geoscience and remote sensing, vol 53 n° 1 (January 2015)
[article]
Titre : Automatic construction of 3-D building model from airborne LIDAR data through 2-D snake algorithm Type de document : Article/Communication Auteurs : Jianhua Yan, Auteur ; Keqi Zhang, Auteur ; Chengcui Zhang, Auteur ; et al., Auteur Année de publication : 2015 Article en page(s) : pp 3 - 14 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications photogrammétriques
[Termes IGN] algorithme snake
[Termes IGN] données lidar
[Termes IGN] modèle numérique du bâti
[Termes IGN] reconstruction 2D du bâti
[Termes IGN] reconstruction 3D du bâti
[Termes IGN] topologieRésumé : (Auteur) The snake algorithm has been proposed to solve many remote sensing and computer vision problems such as object segmentation, surface reconstruction, and object tracking. This paper introduces a framework for 3-D building model construction from LIDAR data based on the snake algorithm. It consists of nonterrain object identification, building and tree separation, building topology extraction, and adjustment by the snake algorithm. The challenging task in applying the snake algorithm to building topology adjustment is to find the global minima of energy functions derived for 2-D building topology. The traditional snake algorithm uses dynamic programming for computing the global minima of energy functions which is limited to snake problems with 1-D topology (i.e., a contour) and cannot handle problems with 2-D topology. In this paper, we have extended the dynamic programming method to address the snake problems with a 2-D planar topology using a novel graph reduction technique. Given a planar snake, a set of reduction operations is defined and used to simplify the graph of the planar snake into a set of isolated vertices while retaining the minimal energy of the graph. Another challenging task for 3-D building model reconstruction is how to enforce different kinds of geometric constraints during building topology refinement. This framework proposed two energy functions, deviation and direction energy functions, to enforce multiple geometric constraints on 2-D topology refinement naturally and efficiently. To examine the effectiveness of the framework, the framework has been applied on different data sets to construct 3-D building models from airborne LIDAR data. The results demonstrate that the proposed snake algorithm successfully found the global optima in polynomial time for all of the building topologies and generated satisfactory 3-D models for most of the buildings in the study areas. Numéro de notice : A2015-039 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1109/TGRS.2014.2312393 En ligne : https://doi.org/10.1109/TGRS.2014.2312393 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=75121
in IEEE Transactions on geoscience and remote sensing > vol 53 n° 1 (January 2015) . - pp 3 - 14[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 065-2015011 RAB Revue Centre de documentation En réserve L003 Disponible Scale-specific automated line simplification by vertex clustering on a hexagonal tessellation / Paulo Raposo in Cartography and Geographic Information Science, vol 40 n° 5 (November 2013)
[article]
Titre : Scale-specific automated line simplification by vertex clustering on a hexagonal tessellation Type de document : Article/Communication Auteurs : Paulo Raposo, Auteur Année de publication : 2013 Article en page(s) : pp 427 - 443 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] analyse de groupement
[Termes IGN] distance de Hausdorff
[Termes IGN] généralisation cartographique automatisée
[Termes IGN] noeud
[Termes IGN] simplification de contour
[Termes IGN] tessellationRésumé : (Auteur) A new method of cartographic line simplification is presented. Regular hexagonal tessellations are used to sample lines for simplification, where hexagon width, reflecting sampling fidelity, is varied in proportion to target scale and drawing resolution. Tesserae constitute loci at which new sets of vertices are defined by vertex clustering quantization, and these vertices are used to compose simplified lines retaining only visually resolvable detail at target scale. Hexagon scaling is informed by the Nyquist–Shannon sampling theorem. The hexagonal quantization algorithm is also compared to an implementation of the Li–Openshaw raster-vector algorithm, which undertakes a similar process using square raster cells. Lines produced by either algorithm using like tessera widths are compared for fidelity to the original line in two ways: Hausdorff distances to the original lines are statistically analyzed, and simplified lines are presented against input lines for visual inspection. Results show that hexagonal quantization offers advantages over square tessellations for vertex clustering line simplification in that simplified lines are significantly less displaced from input lines. Visual inspection suggests lines produced by hexagonal quantization retain informative geographical shapes for greater differences in scale than do those produced by quantization in square cells. This study yields a scale-specific cartographic line simplification algorithm, following Li and Openshaw's natural principle, which is readily applicable to cartographic linework. Open-source Java code implementing the hexagonal quantization algorithm is available online. Numéro de notice : A2013-764 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1080/15230406.2013.803707 En ligne : https://doi.org/10.1080/15230406.2013.803707 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32900
in Cartography and Geographic Information Science > vol 40 n° 5 (November 2013) . - pp 427 - 443[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 032-2013051 RAB Revue Centre de documentation En réserve L003 Disponible Geometric structure simplification of 3D building models / Qingquan Li in ISPRS Journal of photogrammetry and remote sensing, vol 84 (October 2013)
[article]
Titre : Geometric structure simplification of 3D building models Type de document : Article/Communication Auteurs : Qingquan Li, Auteur ; Xuan Sun, Auteur ; Bisheng Yang, Auteur ; Shaobo Jiang, Auteur Année de publication : 2013 Article en page(s) : pp 100 - 113 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications photogrammétriques
[Termes IGN] bâtiment
[Termes IGN] modèle 3D de l'espace urbain
[Termes IGN] modèle numérique du bâti
[Termes IGN] reconstruction 3D du bâti
[Termes IGN] simplification de contour
[Termes IGN] simplification de surfaceRésumé : (Auteur) The complexity of building models directly affects the application efficiencies of 3D urban maps. To address the challenges of building models with various structures, we propose a structural simplification method in this paper. The geometric structures of building models are classified into three categories: embedded structures, compositional structures, and connecting structures, which can be extracted separately through convex/concave analysis. Some specific rules are proposed for the simplification of geometric structures, and the building models are suggested to be simplified progressively. The robustness and efficiency of the method are demonstrated by experiments, and the applications of the Levels of detail of the building models are illustrated. Numéro de notice : A2013-519 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2013.07.006 En ligne : https://doi.org/10.1016/j.isprsjprs.2013.07.006 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32656
in ISPRS Journal of photogrammetry and remote sensing > vol 84 (October 2013) . - pp 100 - 113[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 081-2013101 RAB Revue Centre de documentation En réserve L003 Disponible Automated thinning of road networks and road labels for multiscale design of The National Map of the United States / Cynthia A. Brewer in Cartography and Geographic Information Science, vol 40 n° 4 (September 2013)
[article]
Titre : Automated thinning of road networks and road labels for multiscale design of The National Map of the United States Type de document : Article/Communication Auteurs : Cynthia A. Brewer, Auteur ; Lauwrence V. Stanislawski, Auteur ; Barbara P. Buttenfield, Auteur Année de publication : 2013 Article en page(s) : pp 259 - 270 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] carte topographique
[Termes IGN] conception cartographique
[Termes IGN] Etats-Unis
[Termes IGN] généralisation cartographique automatisée
[Termes IGN] réseau routier
[Termes IGN] simplification de contour
[Termes IGN] The National Map (USA)
[Termes IGN] traitement automatique de données
[Termes IGN] traitement géométrique de donnéesRésumé : (Auteur) This paper reports on progress in generalization and selective feature removal for a subset of fundamental base map layers that enables competent mapping through scales ranging from 1:24,000 to 1:1,000,000. Thinning and partitioning methods are applied to road features and labels for The National Map of the United States. Roads are thinned adaptively using the ArcGIS Thin Road Network geoprocessing tool, which removes features by feature hierarchy and network connectivity, yet preserves characteristic urban/rural local density patterns that can be lost through simple category removals. The paper describes thinning for label hierarchies within road categories, improved preference in placement for more important road labels, and selective removal of labels through scale. Use of the Radical Law to guide matches between thinning parameters and suitable scales of representation also is shown. Inspection of graphic results of these treatments can help to establish parameters for automated base map design for US topographic mapping. Numéro de notice : A2013-757 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1080/15230406.2013.799735 En ligne : https://doi.org/10.1080/15230406.2013.799735 Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32893
in Cartography and Geographic Information Science > vol 40 n° 4 (September 2013) . - pp 259 - 270[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 032-2013041 RAB Revue Centre de documentation En réserve L003 Disponible Topologically safe curved schematisation / Arthur Van Goethem in Cartographic journal (the), vol 50 n° 3 (August 2013)PermalinkA symmetry detector for map generalization and urban-space analysis / Jan‐Henrik Haunert in ISPRS Journal of photogrammetry and remote sensing, vol 74 (Novembrer 2012)PermalinkUsing snakes for the registration of topographic road database objects to ALS features / J. Göpfert in ISPRS Journal of photogrammetry and remote sensing, vol 66 n° 6 (November 2011)PermalinkSimultaneous & topologically-safe line simplification for a variable-scale planar partition / Martijn Meijers (31/01/2011)PermalinkClassics in cartography / Martin Dodge (2011)PermalinkA three-dimensional Douglas-Peucker algorithm and its application to automated generalization of DEMs / Fei Lifan in International journal of geographical information science IJGIS, vol 23 n° 6 (june 2009)PermalinkLength-preserving thinning algorithm for line extraction from land cover data / J. Choi in Cartographica, vol 43 n° 4 (December 2008)PermalinkCartographic generalisation of lines based on a B-spline snake model / E. Guilbert in International journal of geographical information science IJGIS, vol 22 n° 8-9 (august 2008)PermalinkA simplicial complex-based DBMS approach to 3D topographic data modelling / F. Penninga in International journal of geographical information science IJGIS, vol 22 n° 6-7 (june 2008)PermalinkPermalinkA new model for cloud tracking and analysis on satellite images / E. Guilbert in Geoinformatica, vol 11 n° 3 (September - November 2007)PermalinkThe drainage network extraction from contour lines for contour line generalization / Tinghua Ai in ISPRS Journal of photogrammetry and remote sensing, vol 62 n° 2 (June 2007)PermalinkVers un fond vert commun IGN-IFN / Françoise de Blomac in SIG la lettre, n° 86 (avril 2007)PermalinkDynamic simplification and visualization of large maps / N. Mustafa in International journal of geographical information science IJGIS, vol 20 n° 3 (march 2006)PermalinkConflict removal between B-spline curves for isobathymetric line generalization using a snake model / E. Guilbert in Cartography and Geographic Information Science, vol 33 n° 1 (January 2006)PermalinkFourier series and the cartographic line / G.J. Lawford in International journal of geographical information science IJGIS, vol 20 n° 1 (january 2006)PermalinkCritical point detection using the length ration (LR) for line generalization / Byron Nakos in Cartographica, vol 40 n° 3 (September 2005)PermalinkGeneralization of contours using deviation angles and errors bands / T. Gökgöz in Cartographic journal (the), vol 42 n° 2 (September 2005)PermalinkExtraction d'éléments curvilignes guidée par des mécanismes attentionnels pour des images de télédétection : approche par fusion de données / Gilles Cotteret (2005)PermalinkPropagation of the displacements and deformations during a generalisation process / Cristel Legrand (2005)Permalink