Descripteur
Termes IGN > mathématiques > algorithmique > calcul d'itinéraire > chemin le plus court, algorithme du
chemin le plus court, algorithme duSynonyme(s)algorithme de Dijkstra |
Documents disponibles dans cette catégorie (35)
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
Routing in graphs with forbidden paths / Dieter Fritsch in GIS Geo-Informations-Systeme, vol 2002 n° 6 (Juni 2002)
[article]
Titre : Routing in graphs with forbidden paths Type de document : Article/Communication Auteurs : Dieter Fritsch, Auteur ; Wolfgang Schmid, Auteur Année de publication : 2002 Article en page(s) : pp 31 - 36 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique
[Termes IGN] calcul d'itinéraire
[Termes IGN] carte routière
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] graphe
[Termes IGN] recherche du chemin optimal, algorithme deRésumé : (Auteur) Optimal routing in graphs is wellknown and considered as GIS analysis method using spatial geometrictopological data sets. For car navigation applications, the applied algorithms very often solve the problem in a bottomup hierarchy: starting with a dense level of detail (LoD) and then switching to coarse data levels. No matter which LoD is processed there is an unsolved problem dealing with graphs with forbidden paths. As car navigation systems are now adapted to PDAs, the problem is also valid for mobile GIS applications. For this reason the paper introduces into the problem and gives some mathematical definitions needed for the proves afterwards. The problem is solved by a very general solution: finding the kth shortest path simultaneously to the best solution (best in distance or time minimisation). The solution results from path splitting procedures, which is reconnected afterwards with the original graph. Numéro de notice : A2002-355 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : sans Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=22266
in GIS Geo-Informations-Systeme > vol 2002 n° 6 (Juni 2002) . - pp 31 - 36[article]Réservation
Réserver ce documentExemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité 058-02061 RAB Revue Centre de documentation En réserve L003 Disponible Detection of urban structures in SAR images by robust fuzzy clustering algorithms: the example of street tracking / F. Dell'acqua in IEEE Transactions on geoscience and remote sensing, vol 39 n° 10 (October 2001)
[article]
Titre : Detection of urban structures in SAR images by robust fuzzy clustering algorithms: the example of street tracking Type de document : Article/Communication Auteurs : F. Dell'acqua, Auteur ; Paolo Gamba, Auteur Année de publication : 2001 Article en page(s) : pp 2287 - 2297 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image radar et applications
[Termes IGN] analyse de groupement
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] classification floue
[Termes IGN] extraction automatique
[Termes IGN] image aérienne
[Termes IGN] image radar moirée
[Termes IGN] logique floue
[Termes IGN] milieu urbain
[Termes IGN] réseau routier
[Termes IGN] route
[Termes IGN] transformation de HoughRésumé : (Auteur) In this work, we present a fuzzy approach to the analysis of airborne synthetic aperture radar (SAR) images of urban environments. In particular, we want to show how to implement structure extraction algorithms based on fuzzy clustering unsupervised approaches. To this aim, the idea is to segment first the sensed data and recognize very basic urban classes (vegetation, roads, and built areas). Then, from these classes, we extract structures and infrastructures of interest. The initial clustering step is obtained by means of fuzzy logic concepts and the successive analyses are able to exploit the corresponding fuzzy partition. As a possible complete procedure for urban SAR images, in this paper, we focus on the street tracking and extraction problem. Three road extraction algorithms available in literature (namely, the connectivity weighted Hough transform (CWHT), the rotation Hough transform, and the shortest path extraction) have been modified to be consistent with the previously computed fuzzy clustering results. Their different capabilities are applied for the characterization of streets with different width and shape. The whole approach is validated by the analysis of AIRSAR images of Los Angeles, CA. Numéro de notice : A2001-095 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1109/36.957292 En ligne : https://doi.org/10.1109/36.957292 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=21795
in IEEE Transactions on geoscience and remote sensing > vol 39 n° 10 (October 2001) . - pp 2287 - 2297[article]Réservation
Réserver ce documentExemplaires (2)
Code-barres Cote Support Localisation Section Disponibilité 065-01101 RAB Revue Centre de documentation En réserve L003 Disponible 065-01102 RAB Revue Centre de documentation En réserve L003 Disponible Advances in spatial data bases, 5th International Symposium, SSD '97, Berlin, Germany, July 15-18 1997 / Agnès Voisard (1997)
Titre : Advances in spatial data bases, 5th International Symposium, SSD '97, Berlin, Germany, July 15-18 1997 : Proceedings Type de document : Actes de congrès Auteurs : Agnès Voisard, Éditeur scientifique ; Michel Scholl, Éditeur scientifique Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 1997 Collection : Lecture notes in Computer Science, ISSN 0302-9743 num. 1262 Conférence : SSD 1997, 5th International Symposium, Advances in spatial data bases 15/07/1997 18/07/1997 Berlin Allemagne Importance : 373 p. Format : 15 x 23 cm ISBN/ISSN/EAN : 978-3-540-63238-2 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] accès aux données localisées
[Termes IGN] base de données localisées
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] contrainte géométrique
[Termes IGN] données localisées
[Termes IGN] exploration de données géographiques
[Termes IGN] modèle conceptuel de données localisées
[Termes IGN] requête spatiale
[Termes IGN] similitudeNote de contenu : KEYNOTE PAPER
- Spatial Internet Marketplaces : A Grand Challenge ? / D. J. Abel (CSIRO, Canberra, Australia)
SPATIAL SIMILARITIES
- 3D Similarity Search by Shape Approximation / H.P. Kriegel, T. Schmidt, T. Seidl (University of Munich, Germany)
- Finding Boundary Shape Matching Relationships in Spatial Data / E. M. Knorr, R. T. Ng, D. L. Shilvock (Univ. of British Columbia, Canada)
- Spatial Data Mining: A Database Approach / M. Ester, H.P. Kriegel, J. Sander (University of Munich, Germany)
GEOALGORITHMS
- A General and Efficient Implementation of Geometric Operators and Predicates / E. P. F. Chan, J. N. H. Ng (University of Waterloo, Canada)
- Materialization TradeOffs in Hierarchical Shortest Path Algorithms / S. Shekhar, A. Fetterer, B. Goyal (University of Minnesota, USA)
SPATIAL CONSTRAINT DATABASES
- Manipulating Spatial Data in Constraint Databases / A. Belussi (Politecnico di Milano, Italy), E. Bertino, B. Catania (Universita degli Studi di Milano, Italy)
- ConstraintBased Interoperability of Spatiotemporal Databases / J. Chomicki (Monmouth University, USA), P. Z. Revesz (University of Nebraska, USA)
SPATIAL QUERY PROCESSING
- Improving Spatial Intersect Joins Using Symbolic Intersect Detection / Y.W. Huang, M. Jones (University of Michigan, USA), E. A. Rundensteiner (Worcester Polytechnic Institute, USA)
- Data Partitioning for Parallel Spatial Join Processing / X. Zhou, D. J. Abel (CSIR0, Canberra, Australia), D. Truffet (University of Queensland, Australia)
- Orthogonal Polygons as Bounding Structures in FilterRefine Query Processing Strategies / C. Esperança (Universidade Federal do Rio de Janeiro, Brazil), H. Samet (University of Maryland, USA)
SYSTEMS
- From GeoStore to GeoToolKit: The Second Step / 0. Balovnev, M. Breunig, A. B. Cremers (Univ. of Bonn, Germany)
- GeoOpera: Workflow Concepts for Spatial Processes / G. Alonso, C. Hagen (ETH Ziirich, Suntzerland)
- Physical Database Design for Raster Images in CONCERT / L. Relly, H.J. Schek, 0. Henri'csson, S. Nebiker (ETH Ziirich, Switzerland)
SPATIAL DATA MODELS
- Topological Error Correcting in GIS / T. Ubeda (INSA Lyon, France), M. J. Egenhofer (NCGIA and University of Maine, USA)
- Vague Regions / M. Erwig, M. Schneider (Fern Universitdt Hagen, Germany)
- On the Assessment of Generalisation Consistency / V. Delis (Computer Technology Institute, Patras, and University of Patras, Greece), T. Hadzilacos (Computer Technology Institute, Patras, Greece)
SPATIAL ACCESS METHODS
- New Linear Node Splitting Algorithm for Rtrees / C.H. Ang, T.C. Tan (NUS, Singapore)
- An Efficient Index for Multidimensional Objects / C. Aggarwal, J. Wolf, P. Yu (IBM Watson Research Center, USA), M. Epelman (MIT, USA)
KEYNOTE PAPER
- Perspectives in GIS Database Architecture / D. Newell (Smallworldwide plc, United Kingdom)Numéro de notice : 13168 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Actes DOI : 10.1007/3-540-63238-7 En ligne : https://doi.org/10.1007/3-540-63238-7 Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=34621 Réservation
Réserver ce documentExemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité 13168-01 CG.97 Livre Centre de documentation Congrès Disponible