Space-efficient algorithms for approximating polygonal curves in two-dimensional space

International Journal of Computational Geometry and Applications

Volumn 13, Issue 2, 2003, Pages 95-111

  Chen, Danny Z ^a   Daescu, Ovidiu ^b  

^a University of Notre Dame   (United States)

^b The University of Texas at Dallas   (United States)

Author keywords

Approximation; Computational geometry; Linear space; Polygonal curve

Indexed keywords

EID: 0038367602     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195903001086     Document Type: Article

References (28)

1. H. Alt, J. Blomer, M. Godau, and H. Wagener. Approximation of convex polygons. Proc. 10th Coll. on Autom., Lang., and Prog. (ICALP), pages 703-716, 1990.
2. H. Alt, U. Fuchs, G. Rote, and G. Weber. Matching convex shapes with respect to the symmetric difference. Proc. of the 4th Annual European Symp. on Algorithms, pages 320-333, 1996. Barcelona, Spain.
3. G. Barequet, D.Z. Chen, O. Daescu, M.T. Goodrich, and J. Snoeyink. Efficiently approximating polygonal paths in three and higher dimensions. Proc. of the 14th ACM Symp. on Comp. Geometry, pages 317-326, 1998.
4. P. Bose, F. Gomez, P. Ramos, and G.T. Toussaint. Drawing nice projections of objects in space. Actas de Los VI Encuentros de Geometria Computational, pages 102-108, July 1995. Universidad Politecnica de Catalunya, Barcelona, Spain.
5. W.S. Chan and F. Chin. Approximation of polygonal curves with minimum number of line segments or minimum error. International Journal of Computational Geometry and Applications, 6(1):59-77, 1996.
6. D.Z. Chen, W. Chen, K. Wada, and K. Kawaguchi. Parallel algorithms for partitioning sorted sets and related problems. Proc. of the 4th Annual European Symp. on Algorithms, pages 234-245, 1996. Barcelona, Spain.
7. L.P. Cordella and G. Dettori. An O(n) algorithm for polygonal approximation. Pattern Recognition Letters, 3:93-97, 1985.
8. G. Dettori. An on-line algorithm for polygonal approximation of digitized plane curves. Proc. 6th Int. Conf. on Pattern Recognition, pages 18-22, Munich, Oct. 1982.
9. D. Eu and G.T. Toussaint. On approximation polygonal curves in two and three dimensions. CVGIP: Graphical Models and Image Processing, 56(3):231-246, 1994.
10. M.T. Goodrich. Efficient piecewise-linear function approximation using the uniform metric. Proc. 9th Annual ACM Symp. on Computational Geometry, pages 322-331, 1994.
11. L.J. Guibas, J.E. Hershberger, J.S.B. Mitchell, and J.S. Snoeyink. Approximating polygons and subdivisions with minimum link paths. International Journal of Computational Geometry and Applications, 3(4):383-415, 1993.
12. H. Imai and M. Iri. Computational-geometric methods for polygonal approximations of a curve. Computer Vision, Graphics and Image Processing, 36:31-41, 1986.
13. H. Imai and M. Iri. An optimal algorithm for approximating a piecewise linear function. Journal of Information Processing, 9(3):159-162, 1986.
14. H. Imai and M. Iri. Polygonal approximations of a curve-formulations and algorithms. Computational Morphology, pages 71-86, North-Holland, Amsterdam, 1988.
15. Y. Kurozumi and W.A. Davis. Polygonal approximations by the minimax method. Computer Graphics and Image Processing, 19:248-264, 1982.
16. M.K. Leung and Y.-H. Yang. Dynamic two-strip algorithm in curve fitting. Pattern Recognition, 23(1/2):69-79, 1990.
17. R.B. McMaster. A statistical analysis of mathematical measures for linear simplification. American Cartographer, 13:103-116, 1986.
18. A. Melkman and J. O'Rourke. On polygonal chain approximation. Computational Morphology, pages 87-95, North-Holland, Amsterdam, 1988.
19. B.K. Natarajan, On comparing and compressing piecewise linear curves. Technical Report, Hewlett Packard, 1991.
20. B.K. Natarajan and J. Ruppert. On sparse approximations of curves and functions. Proc. 4th Canadian Conference on Computational Geometry, pages 250-256, 1992.
21. T. Pavlidis and S. Horowitz. Segmentation of plane curves. IEEE Thins. Comput., C-23(8):860-870, 1974.
22. J. Sklansky, R.L. Chazin, and B.J. Hansen. Minimum perimeter polygon of digitized silhouettes. IEEE Trans. Comput., 21:260-268, 1972.
23. J. Sklansky and V. Gonzalez. Fast polygonal approximation of digitized curves. Pattern Recognition, 12:327-331, 1980.
24. G.T. Toussaint. On the complexity of approximating polygonal curves in the plane. Proc. IASTED International Symp. on Robotics and Automation, Lugano, Switzerland, 1985.
25. K.R. Varadarajan. Approximating monotone polygonal curves using the uniform metric. Proc. 12th Annual ACM Symp. on Computational Geometry, pages 311-318, 1996.
26. D.P. Wang, N.F. Huang, H.S. Chao, and R.C.T. Lee. Plane sweeping algorithms for polygonal approximation problems with applications. Proc. of the 4th Annual International Symp. on Algorithms and Computation, pages 323-332, 1993.
27. E.R. White. Assessment of line-generalization algorithms using characteristic points. American Cartographer, 12(1):17-27, 1985.
28. C.M. Williams. An efficient algorithm for the piecewise linear approximation of planar curves. Computer Graphics and Image Processing, 8:286-293, 1978.