Descripteur
Documents disponibles dans cette catégorie (933)
![](./images/expand_all.gif)
![](./images/collapse_all.gif)
Etendre la recherche sur niveau(x) vers le bas
Formalizing natural-language spatial relations between linear objects with topological and metric properties / Jingsi Xu in International journal of geographical information science IJGIS, vol 21 n° 3-4 (march - april 2007)
![]()
[article]
Titre : Formalizing natural-language spatial relations between linear objects with topological and metric properties Type de document : Article/Communication Auteurs : Jingsi Xu, Auteur Année de publication : 2007 Article en page(s) : pp 377 - 395 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] ArcGIS
[Termes IGN] caractérisation
[Termes IGN] espace métrique
[Termes IGN] espace topologique
[Termes IGN] formalisation
[Termes IGN] interface utilisateur
[Termes IGN] langage naturel (informatique)
[Termes IGN] objet géographique linéaire
[Termes IGN] relation topologique
[Termes IGN] requête spatialeRésumé : (Auteur) People usually use qualitative terms to express spatial relations, while current geographic information systems (GISs) all use quantitative approaches to store spatial information. The abilities of current GISs to represent and query spatial information about geographic space are limited. Based on the result of a human-subject test of natural-language descriptions of spatial relations between linear geographic objects, this paper defines a series of quantitative indices that are related to natural-language spatial relation terms, and uses these indices to formalize the ambiguous natural-language representation with a decision-tree algorithm. The result indicates that using both topological indices and metric indices can formalize the natural-language spatial predicates better than using only topological indices. The rules extracted from the trees are used to characterize the spatial relations into qualitative description groups. Using these rules, a prototype of an intelligent natural-language interface for the ESRI software ArcGIS that can query spatial relations between two linear objects in natural English language is implemented using SNePS (the Semantic Network Processing System). Copyright Taylor & Francis Numéro de notice : A2007-117 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1080/13658810600894323 En ligne : https://doi.org/10.1080/13658810600894323 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28480
in International journal of geographical information science IJGIS > vol 21 n° 3-4 (march - april 2007) . - pp 377 - 395[article]Réservation
Réserver ce documentExemplaires(2)
Code-barres Cote Support Localisation Section Disponibilité 079-07021 RAB Revue Centre de documentation En réserve L003 Disponible 079-07022 RAB Revue Centre de documentation En réserve L003 Disponible NET-DBSCAN: clustering the nodes of a dynamic linear network / Emmanuel Stefanakis in International journal of geographical information science IJGIS, vol 21 n° 3-4 (march - april 2007)
![]()
[article]
Titre : NET-DBSCAN: clustering the nodes of a dynamic linear network Type de document : Article/Communication Auteurs : Emmanuel Stefanakis, Auteur Année de publication : 2007 Article en page(s) : pp 427 - 442 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] analyse de groupement
[Termes IGN] analyse spatiale
[Termes IGN] exploration de données géographiques
[Termes IGN] graphe
[Termes IGN] Java (langage de programmation)
[Termes IGN] noeud
[Termes IGN] segmentationRésumé : (Auteur) NET-DBSCAN, a method for clustering the nodes of a linear network, whose edges may be temporarily inaccessible, is introduced. The new method extends the idea of a well-known spatial clustering method, named density-based spatial clustering of applications with noise (DBSCAN). The new algorithm is described in detail and through a series of examples. A prototype system, which implements the algorithm, developed in Java and tested through a series of synthetic networks, is also presented. Finally, the application of NET-DBSCAN method to support real-world situations is briefly discussed. Copyright Taylor & Francis Numéro de notice : A2007-119 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658810601034226 En ligne : https://doi.org/10.1080/13658810601034226 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28482
in International journal of geographical information science IJGIS > vol 21 n° 3-4 (march - april 2007) . - pp 427 - 442[article]Réservation
Réserver ce documentExemplaires(2)
Code-barres Cote Support Localisation Section Disponibilité 079-07021 RAB Revue Centre de documentation En réserve L003 Disponible 079-07022 RAB Revue Centre de documentation En réserve L003 Disponible 3D Visualisation of Lidar data: state of the art and proposed system / S. Ghosh in GIM international, vol 21 n° 2 (February 2007)
[article]
Titre : 3D Visualisation of Lidar data: state of the art and proposed system Type de document : Article/Communication Auteurs : S. Ghosh, Auteur ; Bharat Lohani, Auteur Année de publication : 2007 Article en page(s) : pp 15 - 17 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie
[Termes IGN] données lidar
[Termes IGN] entrepôt de données localisées
[Termes IGN] état de l'art
[Termes IGN] photographie aérienne
[Termes IGN] réalité virtuelle
[Termes IGN] Triangulated Irregular Network
[Termes IGN] visualisation 3DRésumé : (Editeur) Over recent years the geo-community has used advances in hardware, software and memory to develop software for visualising remotely sensed data. Its 3D nature and capability for integration with other remotely sensed data at high resolution renders Lidar data ideal for 3D visualisation, particularly in an immersive environment. The authors review the state of the art in (geo-)visualisation techniques and propose a system, effectively an algorithm warehouse for an immersive visualisation interface for Lidar data. Copyright Reed Business Information Numéro de notice : A2007-018 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article DOI : sans Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28384
in GIM international > vol 21 n° 2 (February 2007) . - pp 15 - 17[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 061-07021 RAB Revue Centre de documentation En réserve L003 Disponible Effets spatiaux et effets réseau dans l’évaluation d’indicateurs sur les nœuds d’un réseau d’infrastructure / Jean-François Gleyze in Cybergeo, European journal of geography, n° 2007 ([01/01/2007])
![]()
[article]
Titre : Effets spatiaux et effets réseau dans l’évaluation d’indicateurs sur les nœuds d’un réseau d’infrastructure Titre original : Making allowances for spatial and network effects when assessing indicators on infrastructure network nodes Type de document : Article/Communication Auteurs : Jean-François Gleyze , Auteur
Année de publication : 2007 Article en page(s) : n° 370 Note générale : bibliographie Langues : Français (fre) Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] accessibilité
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] graphe
[Termes IGN] réseau de transport
[Termes IGN] théorie des graphes
[Termes IGN] triangulation de DelaunayRésumé : (auteur) The quantitative study of an infrastructure network in geography often consists in assessing indicators on the network components (nodes and sections). In that respect, the network is modelled by a graph whose vertices and edges respectively correspond to the nodal and linear network infrastructures. Then, such a graph can be studied thanks to tools provided by the graph theory and mainly based on the shortest paths features. The most typical indicators are accessibility (closeness from a given vertex to the others graph vertices, computed in summarizing the shortest path lengths) and centrality or “betweenness” (contribution of a given vertex or edge to the origin-destination paths, computed in counting the shortest paths passing through this component). For this reason, accessibility and centrality features of a vertex depend on the shortest paths distribution on the network, and also on the relative location of the vertex inside the network.
However, the spatial location of vertices predisposes them to be accessible and central, regardless of the relational potentialities provided by the network structure. Actually, a vertex located at the centre (resp. on the periphery) of the network area is more (resp. less) likely to be accessible and central. Therefore, it seems relevant to highlight how the network makes the vertices accessible and central, independently on the advantages only provided by their spatial location. Then, we show that it is possible to make allowances for the corresponding “network and spatial effects” by comparing the shortest paths traditionnally taken into account to compute these indicators with a set of optimal paths called “Delaunay paths”. Besides the study of accessibility and centrality indicators, our method can be extended to the study of any indicator (structural or not), as long as such an indicator is usually computed from shortest paths. It finally provides a useful tool to interpret indicators on a network and to understand the networks contribution to the phenomena described by these indicators.Numéro de notice : A2007-109 Affiliation des auteurs : COGIT (1988-2011) Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.4000/cybergeo.5532 En ligne : https://doi.org/10.4000/cybergeo.5532 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=101424
in Cybergeo, European journal of geography > n° 2007 [01/01/2007] . - n° 370[article]Exact cell decomposition on base map features for optimal path finding / L.S. Pun-Cheng in International journal of geographical information science IJGIS, vol 21 n° 1-2 (january 2007)
![]()
[article]
Titre : Exact cell decomposition on base map features for optimal path finding Type de document : Article/Communication Auteurs : L.S. Pun-Cheng, Auteur ; M.Y. Tanghe, Auteur ; I.K.L. Cheung, Auteur Année de publication : 2007 Article en page(s) : pp 175 - 185 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] arc
[Termes IGN] itinéraire
[Termes IGN] modèle de représentation des données
[Termes IGN] navigation pédestre
[Termes IGN] noeud
[Termes IGN] recherche du chemin optimal, algorithme de
[Termes IGN] théorie des graphesRésumé : (Auteur) Path-finding problems have attracted widespread research interest in GIS-T. Previous research has largely been conducted on developing shortest path algorithms in GIS. The conventional approach is to adopt the arc-node network model, which allows only users with expert knowledge to generate measurements such as optimal paths from a map. However, the generation and maintenance of a centreline network are difficult and tedious because these are not natural on-ground features but imaginary lines on a map. To remedy the situation, a revolutionary approach has been suggested that path-finding method is independent of extra arc-node data creations by end-users. By using the cell-decomposition method borrowed from motion planning of a robot, general map users may obtain an optimal path by just identifying familiarized symbols/outlines from a digital topographic map without resorting to generating an extra set of centrelines. Copyright Taylor & Francis Numéro de notice : A2007-031 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658810600852206 En ligne : https://doi.org/10.1080/13658810600852206 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28397
in International journal of geographical information science IJGIS > vol 21 n° 1-2 (january 2007) . - pp 175 - 185[article]Réservation
Réserver ce documentExemplaires(2)
Code-barres Cote Support Localisation Section Disponibilité 079-07011 RAB Revue Centre de documentation En réserve L003 Disponible 079-07012 RAB Revue Centre de documentation En réserve L003 Disponible Un modèle de classement de services par contribution et utilité / C Constantin in Ingénierie des systèmes d'information, ISI : Revue des sciences et technologies de l'information, RSTI, vol 12 n° 1 (janvier - février 2007)
PermalinkPermalinkCréation de photomodèles adaptés à l'étude des fronts rocheux / Pauline Lucas in XYZ, n° 109 (décembre 2006 - février 2007)
PermalinkFast cluster polygonization and its applications in data-rich environments / I. Lee in Geoinformatica, vol 10 n° 4 (December 2006)
PermalinkIndexing fast moving objects for kNN queries based on nearest landmarks / D. Lin in Geoinformatica, vol 10 n° 4 (December 2006)
Permalinkvol 12 n° HS - 2006 - Langages et modèles à objets : LMO'06, Actes, Nîmes, 22-24 mars 2006 (Bulletin de L'objet : Revue des Sciences et Technologies de l'Information, RSTI) / Roger Rousseau
PermalinkRadial topology algorithm: a new approach for deriving 2.5D GIS data models / U. Lenk in Geoinformatica, vol 10 n° 4 (December 2006)
PermalinkAccuracy of quantized Voronoi diagrams / Yukio Sadahiro in International journal of geographical information science IJGIS, vol 20 n° 10 (november 2006)
PermalinkMonitoring qualitative spatiotemporal change for geosensor networks / Michael F. Worboys in International journal of geographical information science IJGIS, vol 20 n° 10 (november 2006)
PermalinkAnalyse de la vulnérabilité d'un système territorial complexe aux aléas naturels / E. Garbolino in Revue internationale de géomatique, vol 16 n°3 - 4 (septembre – novembre 2006)
Permalink