Efficient algorithms for approximating polygonal chains

Discrete and Computational Geometry

Volumn 23, Issue 2, 2000, Pages 273-291

  Agarwal, P K ^a   Varadarajan, K R ^b  

^a Duke University   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034420984     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009500     Document Type: Article

References (36)

1. P. K. Agarwal, N. Alon, B. Aronov, and S. Suri. Can visibility graphs be represented compactly? Discrete Comput. Geom., 12:347-365, 1994.
2. P. K. Agarwal and M. Sharir. Applications of a new space-partitioning technique. Discrete Comput. Geom., 9:11-38, 1993.
3. A. Aggarwal, H. Booth, J. O'Rourke, S. Suri, and C. K. Yap. Finding minimal convex nested polygons. Inform. Comput., 83(1):98-110, Oct. 1989.
4. N. Alon and J. Spencer. The Probabilistic Method. Wiley, New York, 1993.
5. T. Asano and N. Katoh. Number theory helps line detection in digital images. In Proc. 4th Annual International Symposium on Algorithms and Computing, volume 762 of Lecture Notes in Computer Science, pages 313-322. Springer-Verlag, Berlin, 1993.
6. R. E. Bellman and R. S. Roth. Methods in Approximation: Techniques for Mathematical Modelling. Reidel, Boston, MA, 1986.
7. B. Buttenfield. Treatment of the cartographic line. Cartographica, 22:1-26, 1985.
8. W. S. Chan and F. Chin. Approximation of polygonal curves with minimum number of line segments. In Proc. 3rd Annual International Symposium on Algorithms and Computing, volume 650 of Lecture Notes in Computer Science, pages 378-387. Springer-Verlag, Berlin, 1992.
9. S.D. Conte and C. de Boor. Elementary Numerical Analysis: An Algorithmic Approach, 3rd edn. McGraw-Hill, New York, 1980.
10. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
11. R. G. Cromley. A vertex substitution approach to numerical line simplification. In Proc. 3rd International Symposium Spatial Data Handling, pages 57-64, 1988.
12. P. J. Davis. Interpolation and Approximation. Blaisdell, New York, 1963.
13. M. de Berg, M. van Kreveld, and S. Schirra. A new approach to subdivision simplification. In Proc. 12th International Symposium on Computer-Assisted Cartography, pages 79-88, 1995.
14. P. Dierckx. Curve and Surface Fitting with Splines. Clarendon Press, New York, 1993.
15. D.H. Douglas and T. K. Peucker. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Canad. Cartog., 10(2):112-122, Dec. 1973.
16. D. Eu and G. T. Toussaint. On approximating polygonal curves in two and three dimensions. CVGIP: Graph. Models Image Process., 56(3):231-246, May 1994.
17. T. Feder and R. Motwani. Clique partitions, graph compression, and speeding up algoithms. In Proc. 27th Annual ACM Symposium on Theory of Computing, pages 123-133, 1991.
18. M. T. Goodrich. Efficient piecewise-linear function approximation using the uniform metric. Discrete Comput. Geom., 14:445-62, 1995.
19. L. J. Guibas, J. E. Hershberger, J. S. B. Mitchell, and J. S. Snoeyink. Approximating polygons and subdivisions with minimum link paths. Internat. J. Comput. Geom. Appl., 3(4):383-415, Dec. 1993.
20. S. L. Hakimi and E. F. Schmeichel. Fitting polygonal functions to a set of points in the plane. CVGIP: Graph. Models Image Process., 53(2):132-136, 1991.
21. J. Hershberger and J. Snoeyink. Speeding up the Douglas-Peucker line simplification algorithm. In Proc. 5th International Symposium on Spatial Data Handling, pages 134-143, 1992.
22. J. Hershberger and J. Snoeyink. Computing minimum length paths of a given homotopy class. Comput. Geom. Theory Appl., 4:63-98, 1994.
23. J. Hershberger and J. Snoeyink. Cartographic line simplification and polygon CSG formulae in O(n log* n) time. In Proc. 5th International Workshop on Algorithms and Data Structures, volume 1272 of Lecture Notes in Computer Science, pages 93-103. Springer-Verlag, Berlin, 1997.
24. J. D. Hobby. Polygonal approximations that minimize the number of inflections. In Proc. 4th ACM-SIAM Symposium on Discrete Algorithms, pages 93-102, 1993.
25. H. Imai and M. Iri. Polygonal approximations of a curve-formulations and algorithms. In G. T. Toussaint, editor, Computational Morphology, pages 71-86. North-Holland, Amsterdam, 1988.
26. S. Kahan and J. Snoeyink. On the bit complexity of minimum link paths: superquadratic algorithms for problems solvable in linear time. In Proc. 12th Annual ACM Symposium on Computational Geometry, pages 151-158, 1996.
27. M. J. Katz and M. Sharir. An expander-based approach to geometric optimization. SIAM J. Comput., 26:1384-1408, 1997.
28. Y. Kurozumi and W. A. Davis. Polygonal approximation by the minimax method. Comput. Graph. Image Process., 19:248-264, 1982.
29. Z. Li and S. Openshaw. Algorithms for automated line generalization based on a natural principle of objective generalization. Internat. J. Geogr. Inform. Systems, 6:373-389, 1992.
30. J. Matoušek. Randomized optimal algorithm for slope selection. Inform. Process. Lett., 39:183-187, 1991.
31. R. B. McMaster. Automated line generation. Cartographica, 24(2):74-111, 1987.
32. A. Melkman. On-line construction of the convex hull of a simple polyline. Inform. Process. Lett., 25:11-12, 1987
33. A. Melkman and J. O'Rourke. On polygonal chain approximation. In G. T. Toussaint, editor, Computational Morphology, pages 87-95. North-Holland, Amsterdam, 1988.
34. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985
35. S. Suri. A linear time algorithm for minimum link paths inside a simple polygon. Comput. Vision Graph. Image Process., 35:99-110, 1986.
36. G. T. Toussaint. On the complexity of approximating polygonal curves in the plane. In Proc. IASTED, International Symposium on Robotics and Automation, 1985.