%0 Journal Article %1 Jones:October1995:1523-0406:317 %A Jones, Christopher B. %A Bundy, Geraint L. %A Ware, Mark J. %D October 1995 %J Cartography and Geographic Information Science %K buildinggroup generalization maarb map nichtverfügbar %P 317-331(15) %R 10.1559/152304095782540221 %T Map Generalization with a Triangulated Data Structure %U http://www.ingentaconnect.com/content/acsm/cagis/1995/00000022/00000004/art00006 %V 22 %X Automation of map generalization requires facilities to monitor the spatial relationships and interactions among multiple map objects. An experimental map generalization system has been developed which addresses this issue by representing spatial objects within a simplicial data structure (SDS) based on constrained Delaunay triangulation of the source data. Geometric generalization operators that have been implemented include object exaggeration, collapse, amalgamation, boundary reduction and displacement. The generalization operators exploit a set of primitive SDS functions to determine topological and proximal relationships, measure map objects, apply transformations, and detect and resolve spatial conflicts. Proximal search functions are used for efficient analysis of the structure and dimensions of the intervening spaces between map objects. Because geometric generalization takes place within a fully triangulated representation of the map surface, the presence of overlap conflicts, resulting from individual operators, can be detected due to the introduction of singularities in the triangulation, the structure of which is used to generate displacement vectors to resolve the conflict. Examples of the application of the implemented operators are described and illustrated using large scale topographic map data.

@article{Jones:October1995:1523-0406:317, abstract = {Automation of map generalization requires facilities to monitor the spatial relationships and interactions among multiple map objects. An experimental map generalization system has been developed which addresses this issue by representing spatial objects within a simplicial data structure (SDS) based on constrained Delaunay triangulation of the source data. Geometric generalization operators that have been implemented include object exaggeration, collapse, amalgamation, boundary reduction and displacement. The generalization operators exploit a set of primitive SDS functions to determine topological and proximal relationships, measure map objects, apply transformations, and detect and resolve spatial conflicts. Proximal search functions are used for efficient analysis of the structure and dimensions of the intervening spaces between map objects. Because geometric generalization takes place within a fully triangulated representation of the map surface, the presence of overlap conflicts, resulting from individual operators, can be detected due to the introduction of singularities in the triangulation, the structure of which is used to generate displacement vectors to resolve the conflict. Examples of the application of the implemented operators are described and illustrated using large scale topographic map data.}, added-at = {2010-12-11T20:34:24.000+0100}, author = {Jones, Christopher B. and Bundy, Geraint L. and Ware, Mark J.}, biburl = {https://www.bibsonomy.org/bibtex/2f30fb040c2eed20b904affab901e540f/juku}, description = {ingentaconnect Map Generalization with a Triangulated Data Structure}, doi = {10.1559/152304095782540221}, interhash = {8d04aac05914a0c6166e3b5f4f715d31}, intrahash = {f30fb040c2eed20b904affab901e540f}, journal = {Cartography and Geographic Information Science}, keywords = {buildinggroup generalization maarb map nichtverfügbar}, pages = {317-331(15)}, timestamp = {2010-12-11T20:34:25.000+0100}, title = {Map Generalization with a Triangulated Data Structure}, url = {http://www.ingentaconnect.com/content/acsm/cagis/1995/00000022/00000004/art00006}, volume = 22, year = {October 1995} }