Centre de documentation
scientifique

Topological feature vectors for exploring topological relationships / R. Praing in International journal of geographical information science IJGIS, vol 23 n°3-4 (march - april 2009)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 23 n°3-4 (march - april 2009) . - pp 319 - 353 Titre : Topological feature vectors for exploring topological relationships Type de document : Article/Communication Auteurs : R. Praing, Auteur ; Monique Schneider, Auteur Année de publication : 2009 Article en page(s) : pp 319 - 353 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] détail topographique [Termes IGN] données vectorielles [Termes IGN] exploration de données géographiques [Termes IGN] primitive géométrique [Termes IGN] relation topologique Résumé : (Auteur) Topological relationships between spatial objects such as overlap, disjoint, and inside have for a long time been a focus of research in a number of disciplines like cognitive science, robotics, linguistics, artificial intelligence, and spatial reasoning. In particular as predicates, they support the design of suitable query languages for spatial data retrieval and analysis in spatial database systems and Geographic Information Systems. While conceptual aspects of topological predicates (like their definition and reasoning with them) as well as strategies for avoiding unnecessary or repetitive predicate evaluations (like predicate migration and spatial index structures) have been emphasized, the development of correct and efficient implementation techniques for them has been rather neglected. Recently, the design of topological predicates for different combinations of complex spatial data types has led to a large increase of their numbers and accentuated the need for their efficient implementation. The goal of this article is to develop efficient implementation techniques of topological predicates for all combinations of the complex spatial data types point2D, line2D, and region2D, as they have been specified by different authors and in different commercial and public domain software packages. Our solution is a two-phase approach. In the exploration phase, for a given scene of two spatial objects, all topological events like intersection and meeting situations are recorded in two precisely defined topological feature vectors (one for each argument object of a topological predicate) whose specifications are characteristic and unique for each combination of spatial data types. These vectors serve as input for the evaluation phase which analyzes the topological events and determines the Boolean result of a topological predicate or the kind of topological predicate. This paper puts an emphasis on the exploration phase and the definition of the topological feature vectors. In addition, it presents a straightforward evaluation method. Copyright Taylor & Francis Numéro de notice : A2009-153 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658810802001305 En ligne : https://doi.org/10.1080/13658810802001305 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29783 [article]

Exemplaires(2)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-09021	RAB	Revue	Centre de documentation	En réserve L003	Disponible
079-09022	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Efficient implementation techniques for topological predicates on complex spatial objects / R. Praing in Geoinformatica, vol 12 n° 3 (September - November 2008)  

Public [article]  inGeoinformatica > vol 12 n° 3 (September - November 2008) . - pp 313 - 356 Titre : Efficient implementation techniques for topological predicates on complex spatial objects Type de document : Article/Communication Auteurs : R. Praing, Auteur ; Monique Schneider, Auteur Année de publication : 2008 Article en page(s) : pp 313 - 356 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] arbre de décision [Termes IGN] données vectorielles [Termes IGN] implémentation (informatique) [Termes IGN] matrice [Termes IGN] méthode robuste [Termes IGN] objet géographique complexe [Termes IGN] optimisation (mathématiques) [Termes IGN] prédicat [Termes IGN] relation topologique Résumé : (Auteur) Topological relationships like overlap, inside, meet, and disjoint uniquely characterize the relative position between objects in space. For a long time, they have been a focus of interdisciplinary research as in artificial intelligence, cognitive science, linguistics, robotics, and spatial reasoning. Especially as predicates, they support the design of suitable query languages for spatial data retrieval and analysis in spatial database systems and geographical information systems. While, to a large extent, conceptual aspects of topological predicates (like their definition and reasoning with them) as well as strategies for avoiding unnecessary or repetitive predicate executions (like predicate migration and spatial index structures) have been emphasized, the development of robust and efficient implementation techniques for them has been largely neglected. Especially the recent design of topological predicates for all combinations of complex spatial data types has resulted in a large increase of their numbers and stressed the importance of their efficient implementation. The goal of this article is to develop correct and efficient implementation techniques of topological predicates for all combinations of complex spatial data types including two-dimensional point, line, and region objects, as they have been specified by different authors and in different commercial and public domain software packages. Our solution consists of two phases. In the exploration phase, for a given scene of two spatial objects, all topological events like intersection and meeting situations are summarized in two precisely defined topological feature vectors (one for each argument object of a topological predicate) whose specifications are characteristic and unique for each combination of spatial data types. These vectors serve as input for the evaluation phase which analyzes the topological events and determines the Boolean result of a topological predicate (predicate verification) or the kind of topological predicate (predicate determination) by a formally defined method called nine-intersection matrix characterization. Besides this general evaluation method, the article presents an optimized method for predicate verification, called matrix thinning, and an optimized method for predicate determination, called minimum cost decision tree. The methods presented in this article are applicable to all known complete collections of mutually exclusive topological predicates that are formally based on the well known nine-intersection model. Copyright Springer Numéro de notice : A2008-283 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-007-0035-y En ligne : https://doi.org/10.1007/s10707-007-0035-y Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29276 [article]

Exemplaires(1)

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