Descripteur
Termes IGN > géomatique > base de données localisées > modèle conceptuel de données localisées > modèle topologique de données
modèle topologique de donnéesSynonyme(s)modele topologiqueVoir 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
Geographic space as a living structure for predicting human activities using big data / Bin Jiang in International journal of geographical information science IJGIS, Vol 33 n° 3-4 (March - April 2019)
[article]
Titre : Geographic space as a living structure for predicting human activities using big data Type de document : Article/Communication Auteurs : Bin Jiang, Auteur ; Zheng Ren, Auteur Année de publication : 2019 Article en page(s) : pp 764 - 779 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] données issues des réseaux sociaux
[Termes IGN] données massives
[Termes IGN] métadonnées
[Termes IGN] mise à l'échelle
[Termes IGN] OpenStreetMap
[Termes IGN] polygone de Thiessen
[Termes IGN] relation topologique
[Termes IGN] représentation des détails topographiques
[Termes IGN] Royaume-UniRésumé : (Auteur) Inspired by Christopher Alexander’s conception of the world – space is not lifeless or neutral, but a living structure involving far more small things than large ones – a topological representation has been previously developed to characterize the living structure or the wholeness of geographic space. This paper further develops the topological representation and living structure for predicting human activities in geographic space. Based on millions of street nodes of the United Kingdom extracted from OpenStreetMap, we established living structures at different levels of scale in a nested manner. We found that tweet locations at different levels of scale, such as country and city, can be well predicted by the underlying living structure. The high predictability demonstrates that the living structure and the topological representation are efficient and effective for better understanding geographic forms. Based on this major finding, we argue that the topological representation is a truly multiscale representation, and point out that existing geographic representations are essentially single scale, so they bear many scale problems such as modifiable areal unit problem, the conundrum of length and the ecological fallacy. We further discuss on why the living structure is an efficient and effective instrument for structuring geospatial big data, and why Alexander’s organic worldview constitutes the third view of space. Numéro de notice : A2019-215 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2018.1427754 Date de publication en ligne : 31/01/2018 En ligne : https://doi.org/10.1080/13658816.2018.1427754 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=92687
in International journal of geographical information science IJGIS > Vol 33 n° 3-4 (March - April 2019) . - pp 764 - 779[article]Réservation
Réserver ce documentExemplaires(2)
Code-barres Cote Support Localisation Section Disponibilité 079-2019031 RAB Revue Centre de documentation En réserve L003 Disponible 079-2019032 RAB Revue Centre de documentation En réserve L003 Disponible Query rewriting for semantic query optimization in spatial databases / Eduardo Mella in Geoinformatica, vol 23 n° 1 (January 2019)
[article]
Titre : Query rewriting for semantic query optimization in spatial databases Type de document : Article/Communication Auteurs : Eduardo Mella, Auteur ; M. Andrea Rodríguez, Auteur ; Loreto Bravo, Auteur ; Diego Gatica, Auteur Année de publication : 2019 Article en page(s) : pp 79 - 104 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] contrainte d'intégrité
[Termes IGN] jointure spatiale
[Termes IGN] optimisation (mathématiques)
[Termes IGN] programmation par contraintes
[Termes IGN] relation topologique
[Termes IGN] requête (informatique)
[Termes IGN] requête spatiale
[Termes IGN] système de gestion de bases de données orientées objetRésumé : (auteur) Query processing is an important challenge for spatial databases due to the use of complex data types that represent spatial attributes. In particular, due to the cost of spatial joins, several optimization algorithms based on indexing structures exist. The work in this paper proposes a strategy for semantic query optimization of spatial join queries. The strategy detects queries with empty results and rewrites queries to eliminate unnecessary spatial joins or to replace spatial by thematic joins. This is done automatically by analyzing the semantics imposed by the database schema through topological dependencies and topological referential integrity constraints. In this way, the strategy comes to complement current state-of-art algorithms for processing spatial join queries. The experimental evaluation with real data sets shows that the optimization strategy can achieve a decrease in the time cost of a join query using indexing structures in a spatial database management system (SDBMS). Numéro de notice : A2019-224 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s10707-018-00335-w Date de publication en ligne : 04/01/2019 En ligne : http://dx.doi.org/10.1007/s10707-018-00335-w Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=92623
in Geoinformatica > vol 23 n° 1 (January 2019) . - pp 79 - 104[article]Simultaneous chain-forming and generalization of road networks / Susanne Wenzel in Photogrammetric Engineering & Remote Sensing, PERS, vol 85 n° 1 (January 2019)
[article]
Titre : Simultaneous chain-forming and generalization of road networks Type de document : Article/Communication Auteurs : Susanne Wenzel, Auteur ; Dimitri Bulatov, Auteur Année de publication : 2019 Article en page(s) : pp 19 - 28 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] algorithme de Douglas-Peucker
[Termes IGN] analyse de groupement
[Termes IGN] Autriche
[Termes IGN] axe médian
[Termes IGN] classification bayesienne
[Termes IGN] extraction du réseau routier
[Termes IGN] itération
[Termes IGN] mise à jour automatique
[Termes IGN] Munich
[Termes IGN] objet géographique linéaire
[Termes IGN] orthoimage
[Termes IGN] polyligne
[Termes IGN] primitive géométrique
[Termes IGN] relation topologique
[Termes IGN] réseau routier
[Termes IGN] segmentation sémantique
[Termes IGN] squelettisation
[Termes IGN] zone urbaine
[Vedettes matières IGN] GénéralisationRésumé : (auteur) Streets are essential entities of urban terrain and their automatic extraction from airborne sensor data is cumbersome because of a complex interplay of geometric, topological, and semantic aspects. Given a binary image representing the road class, centerlines of road segments are extracted by means of skeletonization. The focus of this paper lies in a well-reasoned representation of these segments by means of geometric primitives, such as straight line segments as well as circle and ellipse arcs. Thereby, we aim at a fusion of raw segments to longer chains which better match to the intuitive perception of what a street is. We propose a two-step approach for simultaneous chain-forming and generalization. First, we obtain an over-segmentation of the raw polylines. Then, a model selection approach is applied to decide whether two neighboring segments should be fused to a new geometric entity. For this purpose, we propose an iterative greedy optimization procedure in order to find a strong minimum of a cost function based on a Bayesian information criterion. Starting at the given initial raw segments, we thus can obtain a set of chains describing long alleys and important roundabouts. Within the procedure, topological attributes, such as junctions and neighborhood structures, are consistently updated, in a way that for the greedy optimization procedure, accuracy, model complexity, and topology are considered simultaneously. The results on two challenging datasets indicate the benefits of the proposed procedure and provide ideas for future work. Numéro de notice : A2019-026 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.14358/PERS.85.1.19 Date de publication en ligne : 01/01/2019 En ligne : https://doi.org/10.14358/PERS.85.1.19 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=91962
in Photogrammetric Engineering & Remote Sensing, PERS > vol 85 n° 1 (January 2019) . - pp 19 - 28[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 105-2019011 SL Revue Centre de documentation Revues en salle Disponible
Titre : Visibility estimation in point clouds with variable density Type de document : Article/Communication Auteurs : Pierre Biasutti , Auteur ; Aurélie Bugeau, Auteur ; Jean-François Aujol, Auteur ; Mathieu Brédif , Auteur Editeur : Setúbal [Portugal] : Science and Technology Publications - Scitepress Année de publication : 2019 Projets : GOTMI / Papadakis, Nicolas Conférence : VISAPP 2019, 14th International Conference on Computer Vision Theory and Applications 25/02/2019 25/02/2019 Prague République tchèque https://www.scitepress.org/ProceedingsDetails.aspx?ID=IBjeE0qpff8=&t=1 Importance : pp 27 - 35 Format : 21 x 30 cm Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie
[Termes IGN] densité des points
[Termes IGN] données lidar
[Termes IGN] données localisées 3D
[Termes IGN] reconstruction d'objet
[Termes IGN] semis de points
[Termes IGN] visibilité
[Termes IGN] voisinage (relation topologique)Résumé : (auteur) Estimating visibility in point clouds has many applications such as visualization, surface reconstruction and scene analysis through fusion of LiDAR point clouds and images. However, most current works rely on methods that require strong assumptions on the point cloud density, which are not valid for LiDAR point clouds acquired from mobile mapping systems, leading to low quality of point visibility estimations. This work presents a novel approach for the estimation of the visibility of a point cloud from a viewpoint. The method is designed to be fully automatic and it makes no assumption on the point cloud density. The visibility of each point is estimated by considering its screen-space neighborhood from the given viewpoint. Our results show that our approach succeeds better in estimating the visibility on real-world data acquired using LiDAR scanners. We evaluate our approach by comparing its results to a new manually annotated dataset, which we make available online. Numéro de notice : C2019-007 Affiliation des auteurs : LASTIG MATIS+Ext (2012-2019) Autre URL associée : URL preprint Thématique : IMAGERIE Nature : Communication nature-HAL : ComAvecCL&ActesPubliésIntl DOI : 10.5220/0007308600270035 En ligne : http://dx.doi.org/10.5220/0007308600270035 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=92633 Documents numériques
en open access
Visibility estimation in point clouds with variable density - version HALURL An algorithm for on-the-fly K shortest paths finding in multi-storey buildings using a hierarchical topology model / Rosen Ivanov in International journal of geographical information science IJGIS, vol 32 n° 11-12 (November - December 2018)
[article]
Titre : An algorithm for on-the-fly K shortest paths finding in multi-storey buildings using a hierarchical topology model Type de document : Article/Communication Auteurs : Rosen Ivanov, Auteur Année de publication : 2018 Article en page(s) : pp 2362 - 2385 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Navigation et positionnement
[Termes IGN] bati
[Termes IGN] calcul d'itinéraire
[Termes IGN] cartographie à la volée
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] connexité (graphes)
[Termes IGN] connexité (topologie)
[Termes IGN] modèle topologique de données
[Termes IGN] modélisation 3D du bâti BIM
[Termes IGN] positionnement en intérieurRésumé : (Auteur) This article presents an approach to computing K shortest paths in large buildings with complex horizontal and vertical connectivity. The building topology is obtained from Building Information Model (BIM) and implemented using directed multigraphs. Hierarchical design allows the calculation of feasible paths without the need to load into memory the topology of the entire building. It is possible to expand the graph with new connectivity on-the-fly. The paths calculated may be composed of traversable building components that are located inside the buildings or those that are both inside and outside buildings. The performance (computational time and heap size used) is optimized by using the appropriate collections (maps, lists and sets). The proposed algorithm is evaluated in several use-case scenarios – complete graphs and real building environments. In all test scenarios, the proposed path finding algorithm is faster and uses less memory when compared to the fast version of the Yen’s KSP algorithm. The proposed approach can be successfully used as a first level of coarse-to-fine path finding algorithms. Numéro de notice : A2018-525 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE/POSITIONNEMENT Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2018.1510126 Date de publication en ligne : 24/08/2018 En ligne : https://doi.org/10.1080/13658816.2018.1510126 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=91352
in International journal of geographical information science IJGIS > vol 32 n° 11-12 (November - December 2018) . - pp 2362 - 2385[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 079-2018061 RAB Revue Centre de documentation En réserve L003 Disponible A topology-preserving polygon rasterization algorithm / Chen Zhou in Cartography and Geographic Information Science, Vol 45 n° 6 (November 2018)PermalinkCompactly representing massive terrain models as TINs in CityGML / Kavisha Kumar in Transactions in GIS, vol 22 n° 5 (October 2018)PermalinkA simple line clustering method for spatial analysis with origin-destination data and its application to bike-sharing movement data / Biao He in ISPRS International journal of geo-information, vol 7 n° 6 (June 2018)PermalinkWeighted simplicial complex reconstruction from mobile laser scanning using sensor topology / Stéphane Guinard in Revue Française de Photogrammétrie et de Télédétection, n° 217-218 (juin - septembre 2018)PermalinkSensor-topology based simplicial complex reconstruction from mobile laser scanning / Stéphane Guinard in ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, vol IV-2 (June 2018)PermalinkClassification of topological relations between spatial objects in two‐dimensional space within the dimensionally extended 9‐intersection model / Jingwei Shen in Transactions in GIS, vol 22 n° 2 (April 2018)PermalinkA spatio-temporal scenario model for emergency decision / Cheng Liu in Geoinformatica, vol 22 n° 2 (April 2018)PermalinkGenerating vague neighbourhoods through data mining of passive web data / Paul Brindley in International journal of geographical information science IJGIS, vol 32 n° 3-4 (March - April 2018)PermalinkInterpreting the fuzzy semantics of natural-language spatial relation terms with the fuzzy random forest algorithm / Xiaonan Wang in ISPRS International journal of geo-information, vol 7 n° 2 (February 2018)PermalinkDevelopment of a Protocol to Convert and Manage Underground Infrastructure Maps into Geographic Information Systems (GIS) Format / Guillemette Fonteix (2018)Permalink