Efficiently approximating polygonal paths in three and higher dimensions

Algorithmica (New York)

Volumn 33, Issue 2, 2002, Pages 150-167

  Barequet, G ^a,b   Chen, D Z ^c   Daescu, O ^c   Goodrich, M T ^a,b   Snoeyink, J ^d  

^a Johns Hopkins University   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c University of Notre Dame   (United States)

^d UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Curve approximation; Parametric searching

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; ERROR ANALYSIS; PROBLEM SOLVING;

CURVE APPROXIMATION;

COMPUTER SCIENCE;

EID: 0141991857     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0096-5     Document Type: Article

References (31)

1. P. K. Agarwal, J. Matoušek, and O. Schwarzkopf, Computing many faces in arrangements of lines and segments, SIAM Journal on Computing, 27 (1998), 491-505.
2. H. Alt and M. Godau, Measuring the resemblance of polygonal curves, Proc. 8th Ann. ACM Symp. on Computational Geometry, Berlin, pp. 102-109, 1992.
3. E. M. Arkin, L. P. Chew, D. P. Huttenlocher, K. Kedem, and J. S. B. Mitchell, An efficiently computable metric for comparing polygonal shapes, IEEE Transactions on Pattern Analysis and Machine Intelligence, 13 (1991), 209-216.
4. K. Q. Brown, Geometric transforms for fast geometric algorithms, Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA, 1980.
5. B. Buttenfield, Treatment of the cartographic line, Cartographica, 22 (1996), 1-26.
6. W. S. Chan and F. Chin, Approximation of polygonal curves with minimum number of line segments or minimum error, International Joumal of Computational Geometry and Applications, 6 (1996), 59-77.
7. B. Chazelle and L. J. Guibas, Fractional cascading: I. A data structuring technique, Algorithmica, 1 (1986), 133-162.
8. B. Chazelle and L. J. Guibas, Fractional cascading: II. Applications, Algorithmica, 1 (1986), 163-191.
9. D. Z. Chen and O. Daescu, Space-efficient algorithms for approximating polygonal curves in two-dimensional space, Proc. 4th Ann. Internat. Computing and Combinatorics Conf., Taipei, Lecture Notes in Computer Science, vol. 1449, pp. 45-54, Springer-Verlag, Berlin, 1998.
10. 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 (1973), 112-122.
11. H. Edelsbrunner, L. J. Guibas, and M. Sharir, The complexity and construction of many faces in arrangements of lines and of segments, Discrete & Computational Geometry, 5 (1990), 161-196.
12. D. Eppstein, Faster construction of planar two-centers, Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, New Orleans, LA, 131-138, 1997.
13. J. Erickson, Space-time tradeoffs for emptiness queries, SIAM Journal on Computing, 29 (2000), 1968-1996.
14. D. Eu and G. T. Toussaint, On approximation polygonal curves in two and three dimensions, CVGIP: Graphical Models and Image Processing, 56 (1994), 231-246.
15. R. Fleischer, K. Mehlhom, G. Rote, E. Welzl, and C.-K. Yap, Simultaneous inner and outer approximation of shapes, Algorithmica, 8 (1992), 365-389.
16. M. T. Goodrich, Using approximation algorithms to design parallel algorithms that may ignore processor allocation, Proc. 32nd Ann. IEEE Symp. on Foundations of Computer Science, San Juan, Puerto Rico, pp. 711-722, 1991.
17. M. T. Goodrich and R. Tamassia, Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations, Journal of Algorithms, 23 (1997), 51-73.
18. M. T. Goodrich and R. Tamassia, Dynamic trees and dynamic point location, SIAM Journal on Computing, 28 (1999), 612-636.
19. L. J. Guibas, J. E. Hershberger, J. S. B. Mitchell, and J. S. Snoeyink, Approximating polygons and subdivisions with minimum link paths, International Joumal of Computational Geometry and Applications, 3 (1993), 383-115.
20. I. Ihm and B. Naylor, Piecewise linear approximations of digitized space curves with applications, in Scientific Visualization of Physical Phenomina (N. M. Patrikalakis, ed.), pp. 545-569, Springer-Verlag, Tokyo, 1991.
21. H. Imai and M. Iri, Computational-geometric methods for polygonal approximations of a curve, Computer Vision, Graphics, and Image Processing, 36 (1986), 31-41.
22. H. Imai and M. Iri, Polygonal approximations of a curve-formulations and algorithms, in Computational Morphology (G. Toussaint, ed.), pp. 71-86, North-Holland, Amsterdam, 1988.
23. J. Matoušek and O. Schwarzkopf, On ray shooting in convex polytopes, Discrete & Computational Geometry, 10 (1993), 215-232.
24. M. McAllister and J. Snoeyink, Medial axis generalisation of hydrology networks, AutoCarto 13: ACSM/ASPRS Ann. Convention Technical Papers, Seattle, WA, pp. 164-173, 1997.
25. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, Journal of the ACM, 30 (1983), 852-865.
26. A. Melkman and J. O'Rourke, On polygonal chain approximation, in Computational Morphology (G. Toussaint, ed.), pp. 87-95, North-Holland, Amsterdam, 1988.
27. B. K. Natarajan, On comparing and compressing piecewise linear curves, Technical Report, Hewlett Packard, 1991.
28. B. K. Natarajan and J. Ruppert, On sparse approximations of curves and functions, Proc. 4th Canadian Conf. on Computational Geometry, St. John's, Newfoundland, pp. 250-256, 1992.
29. G. Rote, A new metric between polygons, and how to compute it, Proc. 19th Internat. Colloq. Automata, Languages, and Programming, Vienna, Lecture Notes in Computer Science, vol. 623, pp. 401-415, Springer-Verlag, Berlin, 1992.
30. M. Sharir, A near-linear algorithm for the planar 2-center problem. Discrete & Computational Geometry, 18(1997), 125-134.
31. K. R. Varadarajan, Approximating monotone polygonal curves using the uniform metric, Proc. 12th Ann. ACM Symp. on Computational Geometry, Philadelphia, PA, pp. 311-318, 1996.