New results on path approximation

Algorithmica (New York)

Volumn 38, Issue 1, 2003, Pages 131-143

  Daescu, Ovidiu ^a  

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

Author keywords

Complexity; Curve simplification; Line transversal; Optimization; Path approximation

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; ERROR ANALYSIS; GRAPH THEORY; ITERATIVE METHODS; MATHEMATICAL OPERATORS; OPTIMIZATION; SET THEORY;

CURVE SIMPLIFICATION; ERROR CRITERION; LINE TRANSVERSAL; PATH APPROXIMATION;

ALGORITHMS;

EID: 21144447516     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-003-1046-1     Document Type: Article

References (37)

1. P.K. Agarwal, B. Aronov, and M. Sharir. Line transversals of balls and smallest enclosing cylinders in three dimensions. Discrete & Computational Geometry, 21:373-388, 1999.
2. P.K. Agarwal and K.R. Varadarajan. Efficient algorithms for approximating polygonal chains. Discrete & Computational Geometry, 23:273-291. 2000.
3. H. Alt, J. Blomer, M. Godau, and H. Wagener. Approximation of convex polygons. Proceedings of the 10th Colloquium on Automata, Languages, and Programming (ICALP), pages 703-716, 1990.
4. H. Alt, U. Fuchs, G. Rote, and G. Weber. Matching convex shapes with respect to the symmetric difference. Proceedings of the 4th Annual European Symposium on Algorithms, pages 320-333, 1996.
5. M. Atallah and C. Bajaj. Efficient algorithms for common transversals. Information Processing Letters, 25:87-91, 1987.
6. G. Barequet, D.Z. Chen, O. Daescu, M.T. Goodrich, and J. Snoeyink. Efficiently approximating polygonal paths in three and higher dimensions. Proceedings of the 14th ACM Symposium on Computational Geometry, pages 317-326, 1998.
7. 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.
8. D.Z. Chen and O. Daescu. Space-efficient algorithms for approximating polygonal curves in two dimensional space. Proceedings of the 4th Annual International Computing and Combinatorics Conference, pages 55-64, 1998.
9. L.P. Cordella and G. Dettori. An O(n) algorithm for polygonal approximation. Pattern Recognition Letters, 3:93-97, 1985.
10. 2 distance metric: algorithms, implementations and experiments. Working paper, Oct. 2002.
11. G. Dettori. An on-line algorithm for polygonal approximation of digitized plane curves. Proceedings of the 6th International Conference on Pattern Recognition, pages 18-22, Munich, Oct. 1982.
12. 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. Canadian Cartographer, 10(2):112-122, 1973.
13. H. Edelsbrunner and M. Sharir. The maximum number of ways to stab n convex non-intersecting sets in the plane is 2n - 2. Discrete & Computational Geometry, 5(1):35-42, 1990.
14. 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.
15. M.T. Goodrich. Efficient piecewise-linear function approximation using the uniform metric. Proceedings of the 9th Annual ACM Symposium on Computational Geometry, pages 322-331, 1994.
16. M.T. Goodrich. Efficient piecewise-linear function approximation using the uniform metric. Discrete & Computational Geometry, 14:445-462, 1995.
17. 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.
18. S.L. Hakimi and E.F. Schmeichel. Fitting polygonal functions to a set of points in the plane. CVGIP: Graphical Models Image Processing, 53:132-136, 1991.
19. J. Hersberger and J. Snoeyink. Cartographic line simplification and polygon csg formulae in O(n log* n) time. Proceedings of the 5th International Workshop on Algorithms and Data Structures, pages 93-103, 1997.
20. H. Imai and M. Iri. Computational-geometric methods for polygonal approximations of a curve. Computer Vision, Graphics and Image Processing, 36:31-41, 1986.
21. H. Imai and M. Iri. An optimal algorithm for approximating a piecewise linear function. Journal of Information Processing, 9(3):159-162, 1986.
22. H. Imai and M. Iri. Polygonal approximations of a curve-formulations and algorithms. Computational Morphology, pages 71-86, North-Holland, Amsterdam, 1988.
23. M. Katchalski, T. Lewis, and J. Zaks. Geometric permutations for convex sets. Discrete Mathematics, 54:271-284, 1985.
24. Y. Kurozumi and W.A. Davis. Polygonal approximations by the minimax method. Computer Graphics and Image Processing, 19:248-264, 1982.
25. M.K. Leung and Y.-H. Yang. Dynamic two-strip algorithm in curve fitting. Pattern Recognition, 23(1/2):69-79, 1990.
26. R.B. McMaster. A statistical analysis of mathematical measures for linear simplification. American Cartographer, 13:103-116, 1986.
27. A. Melkman and J. O'Rourke. On polygonal chain approximation. Computational Morphology, pages 87-95, North-Holland, Amsterdam, 1988.
28. B.K. Natarajan. On comparing and compressing piecewise linear curves. Technical Report, Hewlett Packard, 1991.
29. B.K. Natarajan and J. Ruppert. On sparse approximations of curves and functions. Proceedings of the 4th Canadian Conference on Computational Geometry, pages 250-256, 1992.
30. T. Pavlidis and S. Horowitz. Segmentation of plane curves. IEEE Transactions on Computers, C-23(8):860-870, 1974.
31. M. Pellegrini and P. Shor. Finding stabbing lines in 3-space. Discrete & Computational Geometry, 8:191-208, 1992.
32. J. Sklansky, R.L. Chazin, and B.J. Hansen. Minimum perimeter polygon of digitized silhouettes. IEEE Transactions on Computers, 21:260-268, 1972.
33. J. Sklansky and V. Gonzalez. Fast polygonal approximation of digitized curves. Pattern Recognition, 12:327-331, 1980.
34. G.T. Toussaint. On the complexity of approximating polygonal curves in the plane. Proceedings of the IASTED International Symposium on Robotics and Automation, Lugano, Switzerland, 1985.
35. D.P. Wang, N.F. Huang, H.S. Chao, and R.C.T. Lee. Plane sweeping algorithms for polygonal approximation problems with applications. Proceedings of the 4th Annual International Symposium on Algorithms and Computation, pages 323-332, 1993.
36. E.R. White. Assessment of line-generalization algorithms using characteristic points. American Cartographer, 12(1):17-27, 1985.
37. C.M. Williams. An efficient algorithm for the piecewise linear approximation of planar curves. Computer Graphics and Image Processing, 8:286-293, 1978.