Descripteur
Termes IGN > mathématiques > analyse mathématique > topologie > théorie des graphes > graphe > arbre (mathématique) > arbre-R
arbre-RVoir aussi |
Documents disponibles dans cette catégorie (36)
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
Extensions of GAP-tree and its implementation based on a non-topological data model / C. Cheng in International journal of geographical information science IJGIS, vol 22 n° 6-7 (june 2008)
[article]
Titre : Extensions of GAP-tree and its implementation based on a non-topological data model Type de document : Article/Communication Auteurs : C. Cheng, Auteur ; F. Niu, Auteur ; J. Cai, Auteur ; Y. Zhu, Auteur Année de publication : 2008 Article en page(s) : pp 657 - 673 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] arbre-B
[Termes IGN] arbre-R
[Termes IGN] données vectorielles
[Termes IGN] généralisation automatique de données
[Termes IGN] implémentation (informatique)
[Termes IGN] index spatial
[Termes IGN] modèle sémantique de données
[Termes IGN] occupation du sol
[Termes IGN] Pékin (Chine)
[Termes IGN] PostgreSQLRésumé : (Auteur) This paper discusses extensions of GAP-trees from three aspects and its implementation based on non-topological structure in order to enhance access to large vector data sets. First of all, we apply cartographic generalization rules to build a generalization procedure of the GAP-tree, which makes coarse representations more consistent with human cognition. Second, we replace the three-dimensional (pseudo-) Reactive-tree index with a 2D R-tree index and a B-tree index to improve the system efficiency. Finally, we compress a binary GAP-tree into multi-way GAP-trees in order to reduce data redundancy. The shallower multi-way GAP-trees not only eliminate redundant data but also accelerate the system's response time. The extensions have been successfully implemented in PostgreSQL. A test of Beijing's land-use data at the 1:10 000 scale demonstrates that the extended GAP-trees are efficient, compact, and easy to implement. Copyright Taylor & Francis Numéro de notice : A2008-226 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1080/13658810701602120 En ligne : https://doi.org/10.1080/13658810701602120 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29221
in International journal of geographical information science IJGIS > vol 22 n° 6-7 (june 2008) . - pp 657 - 673[article]Réservation
Réserver ce documentExemplaires (2)
Code-barres Cote Support Localisation Section Disponibilité 079-08041 RAB Revue Centre de documentation En réserve L003 Disponible 079-08042 RAB Revue Centre de documentation En réserve L003 Disponible Algorithms for nearest neighbor search on moving object trajectories / E. Frentzos in Geoinformatica, vol 11 n° 2 (June - August 2007)
[article]
Titre : Algorithms for nearest neighbor search on moving object trajectories Type de document : Article/Communication Auteurs : E. Frentzos, Auteur ; K. Gratsias, Auteur ; Nikos Pelekis, Auteur ; et al., Auteur Année de publication : 2007 Article en page(s) : pp 159 - 193 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] arbre-R
[Termes IGN] base de données d'objets mobiles
[Termes IGN] classification barycentrique
[Termes IGN] continuité géographique
[Termes IGN] distance euclidienne
[Termes IGN] objet mobile
[Termes IGN] objet statique
[Termes IGN] spatial metricsRésumé : (Auteur) Nearest Neighbor (NN) search has been in the core of spatial and spatiotemporal database research during the last decade. The literature on NN query processing algorithms so far deals with either stationary or moving query points over static datasets or future (predicted) locations over a set of continuously moving points. With the increasing number of Mobile Location Services (MLS), the need for effective k-NN query processing over historical trajectory data has become the vehicle for data analysis, thus improving existing or even proposing new services. In this paper, we investigate mechanisms to perform NN search on R-tree-like structures storing historical information about moving object trajectories. The proposed (depth-first and best-first) algorithms vary with respect to the type of the query object (stationary or moving point) as well as the type of the query result (historical continuous or not), thus resulting in four types of NN queries. We also propose novel metrics to support our search ordering and pruning strategies. Using the implementation of the proposed algorithms on two members of the R-tree family for trajectory data (namely, the TB-tree and the 3D-R-tree), we demonstrate their scalability and efficiency through an extensive experimental study using large synthetic and real datasets. Copyright Springer Numéro de notice : A2007-236 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-006-0007-7 En ligne : https://doi.org/10.1007/s10707-006-0007-7 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28599
in Geoinformatica > vol 11 n° 2 (June - August 2007) . - pp 159 - 193[article]Réservation
Réserver ce documentExemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité 057-07021 RAB Revue Centre de documentation En réserve L003 Disponible The 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)
[article]
Titre : The drainage network extraction from contour lines for contour line generalization Type de document : Article/Communication Auteurs : Tinghua Ai, Auteur Année de publication : 2007 Article en page(s) : pp 93 - 103 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] arbre-B
[Termes IGN] arbre-R
[Termes IGN] crète (ligne)
[Termes IGN] détection de contours
[Termes IGN] généralisation cartographique automatisée
[Termes IGN] réseau hydrographique
[Termes IGN] simplification de contour
[Termes IGN] triangulation de Delaunay
[Termes IGN] vallée
[Vedettes matières IGN] GénéralisationRésumé : (Auteur) Unlike the simplification of independent line features, the generalization of terrain contour is to handle the “line group", which describes the geomorphologic characteristics, such as the terrain valley and ridge. In decision level, the real operation object in the terrain generalization is not the line segment itself but the drainage network contained in the contour representation. This paper presents a method to generalize contour based on the analysis of drainage structure. The first step is to extract the drainage system from the contour lines and build the associations between the valley branch and the bend group of contour lines. The second step is to analyse the properties of drainage tree structure to decide which branch to be removed, and then to perform the geometric elimination of bends. In this study the extraction of drainage system is directly from contour (other than from DTM data) based on the Delaunay triangulation model. Three kinds of tree structure organization are investigated: the hierarchical binary tree representing the bend inclusion relationship contained in each contour line, the planar structure tree describing valley topological relationship and the semantic hierarchical tree representing valley joint level structure from the point of view of hydrology. Numéro de notice : A2007-257 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2007.04.002 En ligne : https://doi.org/10.1016/j.isprsjprs.2007.04.002 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28620
in ISPRS Journal of photogrammetry and remote sensing > vol 62 n° 2 (June 2007) . - pp 93 - 103[article]Réservation
Réserver ce documentExemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité 081-07041 SL Revue Centre de documentation Revues en salle Disponible Query processing in spatial databases containing obstacles / Jun Zhang in International journal of geographical information science IJGIS, vol 19 n° 10 (november 2005)
[article]
Titre : Query processing in spatial databases containing obstacles Type de document : Article/Communication Auteurs : Jun Zhang, Auteur ; Dimitris Papadias, Auteur ; et al., Auteur Année de publication : 2005 Article en page(s) : pp 1091 - 1111 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] appariement de graphes
[Termes IGN] arbre-R
[Termes IGN] barycentre
[Termes IGN] base de données localisées
[Termes IGN] distance euclidienne
[Termes IGN] jointure spatiale
[Termes IGN] plus proche voisin, algorithme du
[Termes IGN] relation topologique
[Termes IGN] requête spatialeRésumé : (Auteur) Despite the existence of obstacles in many database applications, traditional spatial query processing assumes that points in space are directly reachable and utilizes the Euclidean distance metric. In this paper, we study spatial queries in the presence of obstacles, where the obstructed distance between two points is defined as the length of the shortest path that connects them without crossing any obstacles. We propose efficient algorithms for the most important query types, namely, range search, nearest neighbours, e-distance joins, closest pairs and distance semi-joins, assuming that both data objects and obstacles are indexed by R-trees. The effectiveness of the proposed solutions is verified through extensive experiments. Numéro de notice : A2005-501 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658810500286935 En ligne : https://doi.org/10.1080/13658810500286935 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=27637
in International journal of geographical information science IJGIS > vol 19 n° 10 (november 2005) . - pp 1091 - 1111[article]Réservation
Réserver ce documentExemplaires (2)
Code-barres Cote Support Localisation Section Disponibilité 079-05091 RAB Revue Centre de documentation En réserve L003 Disponible 079-05092 RAB Revue Centre de documentation En réserve L003 Disponible Indexing the trajectories of moving objects in networks / V. Texeira De Almeida in Geoinformatica, vol 9 n° 1 (March - May 2005)
[article]
Titre : Indexing the trajectories of moving objects in networks Type de document : Article/Communication Auteurs : V. Texeira De Almeida, Auteur ; Ralf Hartmut Güting, Auteur Année de publication : 2005 Article en page(s) : pp 33 - 60 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] arbre-R
[Termes IGN] base de données d'objets mobiles
[Termes IGN] base de données spatiotemporelles
[Termes IGN] indexation spatiale
[Termes IGN] navigation
[Termes IGN] objet mobile
[Termes IGN] requête spatiale
[Termes IGN] réseau ferroviaire
[Termes IGN] réseau routier
[Termes IGN] trajectoire (véhicule non spatial)Résumé : (Auteur) The management of moving objects has been intensively studied in recent years. A wide and increasing range dose applications has to deal with spatial objects whose position changes continuously over time, called moving objects. The main interest of these applications is to efficiently store and query the positions of these continuously moving objects. To achieve this goal, index structures are required. The main proposals of index structures for moving objects deal with unconstrained 2-dimensional movement. Constrained movement is a special and a very important case of object movement. For example, cars move in roads and trains in railroads. In this paper we propose a new index structure for moving objects on networks, the MON-Tree. We describe two network models that can be indexed by the MON-Tree. The first model is edge oriented, i.e., the network is of nodes and edges and there is a polyline associated to each edge. The second one is more suitable for transportation networks and is route oriented, i.e., the network consists of routes and junctions. In this model, a polyline also serves as a representation of the routes. We propose the index in terms of the basic algorithms for insertion and querying. We test our proposal in an extensive experimental evaluation with generated data sets using as underlying networks the roads of Germany. In our tests, the MON-Tree shows good scalability and outperforms the competing index structures in updating (index creation) as well as in querying. Numéro de notice : A2005-073 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-004-5621-7 En ligne : https://doi.org/10.1007/s10707-004-5621-7 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=27211
in Geoinformatica > vol 9 n° 1 (March - May 2005) . - pp 33 - 60[article]Réservation
Réserver ce documentExemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité 057-05011 RAB Revue Centre de documentation En réserve L003 Disponible Multi-way distance joins queries in spatial databases / A. Corral in Geoinformatica, vol 8 n° 4 (December 2004)PermalinkShall 3-D city models be managed in a commercial database? / G. Groger in GIS Geo-Informations-Systeme, vol 2004 n° 9 (September 2004)PermalinkExploration et utilisation d'ArcSDE / V. Bonnetain (2004)PermalinkPermalinkPerformance evaluation of lazy deletion methods in R-trees / A. Nanopoulos in Geoinformatica, vol 7 n° 4 (December 2003)PermalinkModélisation et validation d'un système d'information géographique 3D opérationnel / Fabien Ramos (2003)PermalinkSearch algorithms for multiway spatial joins / Dimitris Papadias in International journal of geographical information science IJGIS, vol 16 n° 7 (october 2002)PermalinkMerging R-trees: efficient strategies for local bulk insertion / L. Chen in Geoinformatica, vol 6 n° 1 (March - May 2002)PermalinkSpatial databases : with applications to GIS / Philippe Rigaux (2001)PermalinkPermalink