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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1449, Issue , 1998, Pages 45-55

  Chen, Danny Z ^a   Daescu, Ovidiu ^a  

^a University of Notre Dame   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; ERRORS;

BEST-KNOWN ALGORITHMS; CURVE APPROXIMATION; DEVIATION ERRORS; ERROR TOLERANCE; POLYGONAL CURVE; SPACE BOUNDS; SPACE EFFICIENT ALGORITHMS; TWO DIMENSIONAL SPACES;

APPROXIMATION ALGORITHMS;

EID: 84860128413     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68535-9_8     Document Type: Conference Paper

References (14)

1. Barequet, G., Chen, D. Z., Daescu, O., Goodrich, M. T., Snoeyink, J.: Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Proc. of the 14th ACM Symp. on Comp. Geometry (1998, to appear) 47.
2. Chan, W. S., Chin, F.: Approximation of polygonal curves with minimum number of line segments or minimum error. International Journal of Computational Geometry and Applications 6 (1996) 59-77 46, 47, 48, 49, 50, 54.
3. Chen, D. Z., Chen, W., Wada, K., Kawaguchi, K.: Parallel algorithms for partitioning sorted sets and related problems. Proc. of the 4th Annual European Symp. on Algorithms (1996) 234-245 51.
4. Eu, D., Toussaint, G. T.: On approximation polygonal curves in two and three dimensions. CVGIP: Graphical Models and Image Processing 56 (1994) 231-246 46, 47, 48, 49, 50, 53, 54.
5. Goodrich, M. T.: Efficient piecewise-linear function approximation using the uniform metric. Proc. 9th Annual ACM Symp. on Computational Geometry (1994) 322-331 46.
6. Guibas, L. J., Hershberger, J. E., Mitchell, J. S. B., Snoeyink, J. S.: Approximating polygons and subdivisions with minimum link paths. International Journal of Computational Geometry and Applications 3 (1993) 383-415 46.
7. Hakimi, S. L., Schmeichel, E. F.: Fitting polygonal functions to a set of points in the plane. CVGIP: Graphical Models Image Process. 53 (1991) 132-136.
8. Imai, H., Iri, M.: Computational-geometric methods for polygonal approximations of a curve. Computer Vision, Graphics, and Image Processing 36 (1986) 31-41 46, 47, 49, 50.
9. Imai, H., Iri, M.: Polygonal approximations of a curve-Formulations and algorithms. Computational Morphology (1988) 71-86 46, 47, 49, 50.
10. Melkman, A., O'Rourke, J.: On polygonal chain approximation. Computational Morphology (1988) 87-95 46, 47, 49, 50.
11. Natarajan, B. K., Ruppert, J.: On sparse approximations of curves and functions. Proc. 4th Canadian Conference on Computational Geometry (1992) 250-256 46.
12. Toussaint, G. T.: On the complexity of approximating polygonal curves in the plane. Proc. IASTED International Symp. on Robotics and Automation (1985) 46, 47, 49, 50, 51.
13. Varadarajan, K. R.: Approximating monotone polygonal curves using the uniform metric. Proc. 12th Annual ACM Symp. on Computational Geometry (1996) 311-318 46, 47.
14. Wang, D. P., Huang, N. F., Chao, H. S., Lee, R. C. T.: Plane sweeping algorithms for polygonal approximation problems with applications. Proc. of the 4th Annual International Symp. on Algorithms and Computation (1993) 323-332 46.