Détail de l'autorité
Auto-Carto 1997, 13th international symposium on computer-assisted cartography 07/04/1997 10/04/1997 Seattle Washington - Etats-Unis open access proceedings
nom du congrès :
Auto-Carto 1997, 13th international symposium on computer-assisted cartography
début du congrès :
07/04/1997
fin du congrès :
10/04/1997
ville du congrès :
Seattle
pays du congrès :
Washington - Etats-Unis
site des actes du congrès :
|
Documents disponibles (2)
Ajouter le résultat dans votre panier
Visionner les documents numériques
Affiner la recherche Interroger des sources externes
No fuzzy creep! A clustering algorithm for controlling arbitrary node movement / Francis Harvey (07/04/1997)
contenu dans 1997 ACSM-ASPRS annual convention, Volume 5. Auto-Carto 13 / American society for photogrammetry and remote sensing (1997)
Titre : No fuzzy creep! A clustering algorithm for controlling arbitrary node movement Type de document : Article/Communication Auteurs : Francis Harvey, Auteur ; François Vauglin , Auteur Editeur : Bethesda [Maryland - Etats-Unis] : American Society for Photogrammetry and Remote Sensing ASPRS Année de publication : 07/04/1997 Conférence : Auto-Carto 1997, 13th international symposium on computer-assisted cartography 07/04/1997 10/04/1997 Seattle Washington - Etats-Unis open access proceedings Importance : pp 317 - 326 Format : 21 x 30 cm Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] analyse de groupement
[Termes IGN] géomètrie algorithmique
[Termes IGN] noeudRésumé : (Auteur) A perennial problem in vector overlay is fuzzy creep. Commercial vector overlay algorithms resolve near intersections of lines employing arbitrary node movement to align two chains at nodes selected randomly in the area of an epsilon band. While this solution is effective in reducing the number of sliver polygons, it introduces distortion. In some situations this distortion may be tolerable, but in others it may produce positional errors that are unacceptable for the cartographic or analytical purpose. Our research aims to provide an extension of overlay processing that provides a solution for GIS uses that require more exact control over node movement. The key to this is a robust, non-distorting cluster analysis. The cluster algorithm we present fulfills two goals: 1) it selects nodes based on an nearness heuristic, 2) it allows the user to fix the position of one data set's nodes and moves the other data set's nodes to match these position. In this paper we review existing cluster algorithms from the computational geometry and analytical cartography literature, evaluating their heuristics in terms of the potential to avoid fuzzy creep. Grouping the algorithms into a bit-map and fuzzy-detection types, we discuss the advantages and disadvantages of each approach for controlled near intersection detection. Based on the results of this analysis, we present a algorithm for non-distortive geometric match processing, the basis for our work on geometric match processing. Numéro de notice : C1997-068 Affiliation des auteurs : COGIT+Ext (1988-2011) Thématique : GEOMATIQUE/INFORMATIQUE Nature : Communication nature-HAL : ComAvecCL&ActesPubliésIntl DOI : sans En ligne : https://cartogis.org/docs/proceedings/archive/auto-carto-13/pdf/no-fuzzy-creep-a [...] Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=64340 Documents numériques
en open access
No-fuzzy-creep-a-clustering-algorithm ... - pdf éditeurAdobe Acrobat PDF 1997 ACSM-ASPRS annual convention, Volume 5. Auto-Carto 13 / American society for photogrammetry and remote sensing (1997)ContientRéservation
Réserver ce documentExemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité 17425-01E CG1997 Livre Centre de documentation Congrès Disponible