Area-preserving approximations of polygonal paths

Journal of Discrete Algorithms

Volumn 4, Issue 4, 2006, Pages 554-566

  Bose, Prosenjit ^a   Cabello, Sergio ^b   Cheong, Otfried ^c   Gudmundsson, Joachim ^d   van Kreveld, Marc ^e   Speckmann, Bettina ^f  

^a CARLETON UNIVERSITY   (Canada)

^b INSTITUTE OF MATHEMATICS   (Slovenia)

^c Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^d CSIRO   (Australia)

^e UTRECHT UNIVERSITY   (Netherlands)

^f EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Approximating algorithm; Polygonal line simplification

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL METHODS; INTEGER PROGRAMMING; MEASUREMENT ERRORS; OPTIMIZATION;

APPROXIMATING ALGORITHM; POLYGONAL LINE SIMPLIFICATION; POLYGONAL PATHS;

APPROXIMATION THEORY;

EID: 33750629507     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2005.06.008     Document Type: Article

References (19)

1. Alt H., Blömer J., Godau M., and Wagener H. Approximation of convex polygons. Proc. 17th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science vol. 443 (1990), Springer-Verlag, Berlin 703-716
2. Alt H., Fuchs U., Rote G., and Weber G. Matching convex shapes with respect to the symmetric difference. Algorithmica 21 (1998) 89-103
3. G. Barequet, M.T. Goodrich, D.Z. Chen, O. Daescu, J. Snoeyink, Efficiently approximating polygonal paths in three and higher dimensions, in: Proc. 14th Annual ACM Symposium on Computational Geometry, 1998, pp. 317-326
4. Chan W.S., and Chin F. Approximation of polygonal curves with minimum number of line segments or minimum error. Internat. J. Comput. Geom. Appl. 6 (1996) 59-77
5. Chen D.Z., and Daescu O. Space-efficient algorithms for approximating polygonal curves in two-dimensional space. Internat. J. Comput. Geom. Appl. 13 (2003) 95-111
6. Cromley R.G. Digital Cartography (1992), Prentice Hall, Englewood Cliffs, NJ
7. Dent B.D. Cartography-Thematic Map Design. fifth ed. (1999), McGraw-Hill, New York
8. R. Estkowski, J. Mitchell, Simplifying a polygonal subdivision while keeping it simple, in: Proc. 17th Symp. Comp. Geometry, 2001, pp. 40-49
9. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman, New York, NY
10. Goodrich M.T. Efficient piecewise-linear function approximation using the uniform metric. Discrete Comput. Geom. 14 (1995) 445-462
11. J. Gudmundsson, G. Narasimhan, M. Smid, Distance-preserving simplification of polygonal paths, in: Proc. 23rd Conf. Found. Software Techn. Theor. Comp. Science, 2003
12. Guibas L.J., Hershberger J.E., Mitchell J.S.B., and Snoeyink J.S. Approximating polygons and subdivisions with minimum link paths. Internat. J. Comput. Geom. Appl. 3 (1993) 383-415
13. Imai H., and Iri M. Computational-geometric methods for polygonal approximations of a curve. Computer Vision Graph. Image Process. 36 (1986) 31-41
14. Imai H., and Iri M. Polygonal approximations of a curve-formulations and algorithms. In: Toussaint G.T. (Ed). Computational Morphology (1988), North-Holland, Amsterdam 71-86
15. Langerman S. The complexity of halfspace area queries. Discrete Comput. Geom. 30 (2003) 639-648
16. McMaster R.B., and Shea K.S. Generalization in Digital Cartography (1992), Association of American Cartographers, Washington DC
17. Melkman A., and O'Rourke J. On polygonal chain approximation. Computational Morphology (1988), North-Holland, Amsterdam 87-95
18. K.R. Varadarajan, Approximating monotone polygonal curves using the uniform metric, in: Proc. 12th Annual ACM Symposium on Computational Geometry, 1996, pp. 311-318
19. R.C. Veltkamp, Shape matching: similarity measures and algorithms, in: Proc. Shape Modeling International, 2001, pp. 188-199