Simplifying a polygonal subdivision while keeping it simple

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2001, Pages 40-49

  Estkowski, R ^a   Mitchell, J S B ^a  

^a Hughes Aircraft Co   (United States)

Author keywords

Approximation algorithms; Geographic information systems; Map generalization; Polygonal subdivisions; Simplification

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; POLYNOMIAL APPROXIMATION; TOPOLOGY;

POLYGONAL SUBDIVISIONS;

COMPUTATIONAL GEOMETRY;

EID: 0034819556     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378583.378612     Document Type: Conference Paper

References (21)

1. Geometry in GIS is not combinatorial: Segment intersection for polygon overlay
2. Further comparison of algorithms for geometric intersection problems
3. Heuristics for the generation of random polygons
4. Approximation of polygonal curves with minimum number of line segments or minimum error
5. A vertex substitution approach to numerical line simplification
6. A new approach to subdivision simplification
7. Topologically correct subdivision simplification using the bandwidth criterion
8. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature
9. No steiner point subdivision simplification is NP-complete
10. Approximating polygons and subdivisions with minimum link paths
11. Speeding up the Douglas-Peucker line simplification algorithm
12. Computing minimum length paths of a given homotopy class
13. An O(n log n) implementation of the Douglas-Peucker algorithm for line simplification
14. Polygonal approximations of a curve-formulations and algorithms
15. Map generalization with a triangulated data structure
16. Safe sets for line simplification
17. On polygonal chain approximation
18. Hardware assisted view-dependent map simplification
19. Conflict resolution in map generalization: A cognitive study