Cartographic line simplification and polygon CSG formulæ in O(n log* n) time

Computational Geometry: Theory and Applications

Volumn 11, Issue 3-4, 1998, Pages 175-185

  Hershberger, John ^a   Snoeyink, Jack ^b  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Dynamic convex hull; Path hull; Simple polygon

Indexed keywords

EID: 0345768525     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(98)00027-3     Document Type: Article

References (16)

1. D. Dobkin, L. Guibas, J. Hershberger, J. Snoeyink, An efficient algorithm for finding the CSG representation of a simple polygon, Algorithmica 10 (1993) 1-23.
2. D.H. Douglas, T.K. Peucker, Algorithms for the reduction of the number of points required to represent a line or its caricature, The Canadian Cartographer 10 (2) (1973) 112-122.
3. L. Guibas, J. Hershberger, J. Snoeyink, Compact interval trees: A data structure for convex hulls, Internat. J. Comput. Geom. Appl. 1 (1) (1991) 1-22.
4. L.J. Guibas, J. Hershberger, D. Leven, M. Sharir, R. Tarjan, Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica 2 (1987) 209-233.
5. J. Hershberger, J. Snoeyink, Speeding up the Douglas-Peucker line simplification algorithm, in: Proc. 5th International Symposium on Spatial Data Handling, IGU Commission on GIS, 1992, pp. 134-143.
6. J. Hershberger, J. Snoeyink, An O(n log n) implementation of the Douglas-Peucker line simplification algorithm, in: Proc. 10th Annual ACM Symposium on Computational Geometry, 1994, pp. 383-384. Video Review of Computational Geometry, 4:45 animation.
7. J. Hershberger, J. Snoeyink, An O(n log n) implementation of the Douglas-Peucker line simplification algorithm, in: Proc. 10th Annual ACM Symposium on Computational Geometry, 1994, pp. 383-384. Video Review of Computational Geometry, 4:45 animation.
8. K. Hoffmann, K. Mehlhorn, P. Rosenstiehl, R.E. Tarjan, Sorting Jordan sequences in linear time, Inform. and Control 68 (1986) 170-184.
9. R.B. McMaster, A statistical analysis of mathematical measures for linear simplification, The American Cartographer 13 (1986) 103-116.
10. A.A. Melkman, On-line construction of the convex hull of a simple polyline, Inform. Process. Lett. 25 (1987) 11-12.
11. M. Overmars, J. van Leeuwen, Maintenance of configurations in the plane, J. Comput. System Sci. 23 (1981) 166-204.
12. D.P. Peterson, Halfspace representation of extrusions, solids of revolution, and pyramids, SANDIA Report SAND84-0572, Sandia National Laboratories, 1984.
13. F.P. Preparata, M.I. Shamos, Computational Geometry - An Introduction, Springer, New York, 1985.
14. U. Ramer, An iterative procedure for the polygonal approximation of plane curves, Computer Vision, Graphics, and Image Processing 1 (1972) 244-256.
15. G. Rote, The convergence rate of the Sandwich algorithm for approximating convex functions, Computing 48 (1992) 337-361.
16. E.R. White, Assessment of line-generalization algorithms using characteristic points, The American Cartographer 12 (1) (1985) 17-27.