Descripteur
Termes IGN > mathématiques > géométrie > figure géométrique > surface (géométrie)
surface (géométrie)Voir aussi |
Documents disponibles dans cette catégorie (225)
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
Continuously generalizing buildings to built-up areas by aggregating and growing / Dongliang Peng (2017)
Titre : Continuously generalizing buildings to built-up areas by aggregating and growing Type de document : Article/Communication Auteurs : Dongliang Peng, Auteur ; Guillaume Touya , Auteur Editeur : New York [Etats-Unis] : Association for computing machinery ACM Année de publication : 2017 Conférence : UrbanGIS 2017, 3rd ACM SIGSPATIAL workshop 07/11/2017 10/11/2017 Redondo Beach Californie - Etats-Unis Proceedings ACM Langues : Anglais (eng) Descripteur : [Termes IGN] bati
[Termes IGN] construction
[Termes IGN] distance euclidienne
[Termes IGN] mise à l'échelle
[Termes IGN] polygone
[Termes IGN] simplification de contour
[Vedettes matières IGN] GénéralisationRésumé : (auteur) To enable smooth zooming, we propose a method to continuously generalize buildings from a given start map to a smaller-scale goal map, where there are only built-up area polygons instead of individual building polygons. We name the buildings on the start map original buildings. For an intermediate scale, we aggregate the original buildings that will become too close by adding bridges. We grow (bridged) original buildings based on buffering, and simplify the grown buildings. We take into account the shapes of the buildings both at the previous map and goal map to make sure that the buildings are always growing. The running time of our method is in O (n3), where n is the number of edges of all the original buildings.
The advantages of our method are as follows. First, the buildings grow continuously and, at the same time, are simplified. Second, right angles of buildings are preserved during growing: the merged buildings still look like buildings. Third, the distances between buildings are always larger than a specified threshold. We do a case study to show the performances of our method.Numéro de notice : C2017-027 Affiliation des auteurs : LASTIG COGIT+Ext (2012-2019) Thématique : GEOMATIQUE Nature : Communication nature-HAL : ComAvecCL&ActesPubliésIntl DOI : 10.1145/3152178.3152188 Date de publication en ligne : 01/12/2017 En ligne : https://doi.org/10.1145/3152178.3152188 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=89290 Symbolize map distortion with inscribed circles in polygons / Shipeng Sun in International journal of cartography, vol 2 n° 2 (December 2016)
[article]
Titre : Symbolize map distortion with inscribed circles in polygons Type de document : Article/Communication Auteurs : Shipeng Sun, Auteur Année de publication : 2016 Article en page(s) : pp 166 - 185 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Cartographie
[Termes IGN] carte en anamorphose
[Termes IGN] cartogramme
[Termes IGN] déformation géométrique
[Termes IGN] polygone
[Termes IGN] projection
[Termes IGN] symbole graphiqueRésumé : (Auteur) For the representation of geographic information, the distortion resulting from map projections and transformations is unwanted but unavoidable. Identical circles systematically arranged on the Earth's ellipsoid have been extensively used to symbolize the map distortion. Despite their effectiveness and popularity, these circles are not explicitly associated with any specific polygons in the map, thus possibly impairing their relevance if the map-readers are interested in particular regions. More importantly, for the map transformation specifically targeting polygons such as the area cartogram, placing the circles completely within the polygons becomes necessary because two neighboring polygons in an area cartogram could have distinctive distortion characteristics. This paper proposes new computer algorithms to enable a map-distortion symbolization approach based on inscribed circles entirely contained in polygons either on a projected 2D plane or on the Earth's ellipsoid. These inscribed circles in polygons (ICIP) are rendered as a series of maximum or equal-sized circles that are spatially exclusive, that is, without overlapping. Compared with the systematically arranged identical circles, the ICIP give cartographers certain flexibility and a new option for the map-distortion symbolization. Two area cartograms and three map projections are provided as examples to illustrate their usage and possible contribution in different mapping scenarios. Numéro de notice : A2016--061 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/23729333.2016.1179863 En ligne : http://dx.doi.org/10.1080/23729333.2016.1179863 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=84216
in International journal of cartography > vol 2 n° 2 (December 2016) . - pp 166 - 185[article]Rendering interior-filled polygonal vector data in a virtual globe / Mengyun Zhou in International journal of geographical information science IJGIS, vol 30 n° 11-12 (November - December 2016)
[article]
Titre : Rendering interior-filled polygonal vector data in a virtual globe Type de document : Article/Communication Auteurs : Mengyun Zhou, Auteur ; Jing Chen, Auteur ; Jianya Gong, Auteur Année de publication : 2016 Article en page(s) : pp 2208 - 2229 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] données vectorielles
[Termes IGN] Global Multi-resolution Terrain Elevation Data 2010
[Termes IGN] globe virtuel
[Termes IGN] modèle numérique de surface
[Termes IGN] modélisation 3D
[Termes IGN] polygone
[Termes IGN] rendu (géovisualisation)
[Termes IGN] temps réel
[Vedettes matières IGN] GéovisualisationRésumé : (Auteur) Polygonal vector data are important for representing countries, lakes, residential settlements, and other polygonal features. The proper representation of polygonal vector data is the basis of efficient rendering and picking and quick access and display of the analysis results based on polygons (e.g., 3D overlaying and surface area measurement in mountainous areas) in a virtual globe. However, polygonal vector data are displayed using texture-based or boundary-based approaches in most existing virtual globes. The texture-based approach cannot easily support interactive operations (e.g., picking) and spatial analysis (e.g., adjacency analysis and spatial measurement). The boundary-based approach treats the holes as independent features; however, it is difficult to recognize which boundaries constitute a polygon. Further research is needed on how to better organize the polygons to support efficient rendering, picking, and analysis in a virtual globe. In this article, we propose two methods to drape interior filled 2D polygons onto a multi-resolution 3D terrain. Both proposed methods combine polygon clipping and polygon triangulation. The difference between the two methods is in the way holes are eliminated. Method 1 recursively subdivides a terrain triangle until the child-triangles contain no holes; every resulting clipped polygon, which is then triangulated, contains no holes. Method 2 directly clips a polygon against a terrain triangle and creates bridge edges to transform the resulting polygons with holes to degenerate polygons that are further triangulated. The experimental results demonstrate that both proposed methods can efficiently process polygons with holes resulting in appropriate numbers of triangles. The processed interior-filled polygons remain close to the terrain surface in a virtual globe. Both proposed methods support real-time rendering of polygonal vector data in a virtual globe. Numéro de notice : A2016-751 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2016.1165819 En ligne : http://dx.doi.org/10.1080/13658816.2016.1165819 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=82340
in International journal of geographical information science IJGIS > vol 30 n° 11-12 (November - December 2016) . - pp 2208 - 2229[article]Réservation
Réserver ce documentExemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité 079-2016061 RAB Revue Centre de documentation En réserve L003 Disponible A simulated annealing algorithm for zoning in planning using parallel computing / Inès Santé in Computers, Environment and Urban Systems, vol 59 (September 2016)
[article]
Titre : A simulated annealing algorithm for zoning in planning using parallel computing Type de document : Article/Communication Auteurs : Inès Santé, Auteur ; Francisco F. Rivera, Auteur ; et al., Auteur Année de publication : 2016 Article en page(s) : pp 95 - 106 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] algorithme du recuit simulé
[Termes IGN] Galice (Espagne)
[Termes IGN] optimisation (mathématiques)
[Termes IGN] parcelle cadastrale
[Termes IGN] partition d'image
[Termes IGN] polygone
[Termes IGN] processeur multicoeur
[Termes IGN] utilisation du solRésumé : (auteur) There is an increasing demand for tools that support land use planning processes, particularly the design of zoning maps, which is one of the most complex tasks in the field. In this task, different land use categories need to be allocated according to multiple criteria. The problem can be formalized in terms of a multiobjective problem. This paper generalizes and complements a previous work on this topic. It presents an algorithm based on a simulated annealing heuristic that optimizes the delimitation of land use categories on a cadastral parcel map according to suitability and compactness criteria. The relative importance of both criteria can be adapted to any particular case. Despite its high computational cost, the use of plot polygons was decided because it is realistic in terms of technical application and land use laws. Due to the computational costs of our proposal, parallel implementations are required, and several approaches for shared memory systems such as multicores are analysed in this paper. Results on a real case study conducted in the Spanish municipality of Guitiriz show that the parallel algorithm based on simulated annealing is a feasible method to design alternative zoning maps. Comparisons with results from experts are reported, and they show a high similarity. Results from our strategy outperform those by experts in terms of suitability and compactness. The parallel version of the code produces good results in terms of speed-up, which is crucial for taking advantage of the architecture of current multicore processors. Numéro de notice : A2016-407 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.compenvurbsys.2016.05.005 Date de publication en ligne : 10/06/2016 En ligne : http://dx.doi.org/10.1016/j.compenvurbsys.2016.05.005 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81240
in Computers, Environment and Urban Systems > vol 59 (September 2016) . - pp 95 - 106[article]A point-based methodology for the automatic positional accuracy assessment of geospatial databases / Juan J. Ruiz-Lendínez in Survey review, vol 48 n° 349 (July 2016)
[article]
Titre : A point-based methodology for the automatic positional accuracy assessment of geospatial databases Type de document : Article/Communication Auteurs : Juan J. Ruiz-Lendínez, Auteur ; Francisco Javier Ariza-López, Auteur ; Manuel A. Ureña-Cámara, Auteur Année de publication : 2016 Article en page(s) : pp 269 - 277 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] base de données localisées
[Termes IGN] évaluation
[Termes IGN] points homologues
[Termes IGN] polygone
[Termes IGN] précision du positionnement
[Termes IGN] qualité des donnéesRésumé : (auteur) This paper is based on our earlier paper (Ruiz-Lendínez et al., 2013) of this work and its new contribution is to develop a point-based methodology for the automatic assessment of positional and geometric components of spatial data. The starting point for our approach is the set of homologous polygons obtained according to the methodology developed in Ruiz-Lendínez et al. (2013). From these pairs of polygons, we first have identified and computed homologous points using a metric for comparing polygonal shapes defined by Arkin et al. (1991) and then we have applied a point-based standard developed for assessing the positional accuracy of spatial data. Specifically, we have employed the National Standard Spatial Data Accuracy (NSSDA) standard. The results obtained demonstrate the viability of this point-based evaluation and its potential compared to traditional methods. Numéro de notice : A2016-624 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1179/1752270615Y.0000000030 En ligne : https://doi.org/10.1179/1752270615Y.0000000030 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81827
in Survey review > vol 48 n° 349 (July 2016) . - pp 269 - 277[article]Fusion of hyperspectral images and digital surface models for urban object extraction / Janja Avbelj (2016)PermalinkPhotogrammetric computer vision / Wolfgang Förstner (2016)PermalinkPolygonal clustering analysis using multilevel graph-partition / Wanyi Wang in Transactions in GIS, vol 19 n° 5 (October 2015)PermalinkSemi-automated building footprint extraction from orthophotos / Rheannon Brooks in Geomatica, vol 69 n° 2 (June 2015)PermalinkWeighted straight skeletons in the plane / Therese Biedl in Computational Geometry : theory and applications, vol 48 n° 2 (February 2015)PermalinkPermalinkQuantitative morphometric analysis of lakes using GIS: rectangularity R, ellipticity E, orientation O, and the rectangularity vs. ellipticity index, REi / Umberto Lombardo in Cartography and Geographic Information Science, vol 41 n° 4 (September 2014)PermalinkContext-based automatic reconstruction and texturing of 3D urban terrain for quick-response tasks / Dimitri Bolatov in ISPRS Journal of photogrammetry and remote sensing, vol 93 (July 2014)PermalinkA polygon-based clustering and analysis framework for mining spatial datasets / Sujing Wang in Geoinformatica, vol 18 n° 3 (July 2014)PermalinkL'accroissement de la ressource forestière française : 810 millions de m3 supplémentaires en 30 ans / Antoine Colin in Forêt entreprise, n° 212 (septembre - octobre 2013)Permalink