Polygonal path simplification with angle constraints

Computational Geometry: Theory and Applications

Volumn 32, Issue 3, 2005, Pages 173-187

  Chen, Danny Z ^a   Daescu, Ovidiu ^b   Hershberger, John ^c   Kogge, Peter M ^a   Mi, Ningfang ^b   Snoeyink, Jack ^d  

^a University of Notre Dame   (United States)

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

^c MENTOR GRAPHICS CORPORATION   (United States)

^d Brooks Computer Science Building   (United States)

Author keywords

Angle constraint; Computational geometry; Off line search; Path simplification

Indexed keywords

EID: 25844508974     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2004.09.003     Document Type: Article

References (26)

1. P.K. Agarwal, T. Biedl, S. Lazard, S. Robbins, S. Suri, and S. Whitesides Curvature constrained shortest paths in a convex polygon Proc. 14th ACM Symp. on Comp. Geom. 1998 392 401
2. P.K. Agarwal, S. Har-Peled, N. Mustafa, and Y. Wang Near-linear time approximation algorithms for curve simplification Proc. of 10th Annual European Sympos. Algorithms 2002 29 41
3. P.K. Agarwal, and J. Matoušek Dynamic half-space range reporting and its applications Algorithmica 13 1995 325 345
4. P.K. Agarwal, and K.R. Varadarajan Efficient algorithms for approximating polygonal chains Discrete Comput. Geom. 23 2000 273 291
5. H. Alt, J. Blomer, M. Godau, and H. Wagener Approximation of convex polygons Proc. 10th Coll. on Autom., Lang. and Prog. (ICALP) 1990 703 716
6. J. Anez, T. De La Barra, and B. Perez Dual graph representation of transport networks Transportation Res. B 30 3 1996 209 216
7. G. Barequet, D.Z. Chen, O. Daescu, M.T. Goodrich, and J. Snoeyink Efficiently approximating polygonal paths in three and higher dimensions Algorithmica 33 2 2002 150 167
8. W.S. Chan, and F. Chin Approximation of polygonal curves with minimum number of line segments or minimum error Internat. J. Comput. Geom. Appl. 6 1 1996 59 77 (Pubitemid 126498326)
9. B. Chazelle Lower bounds for off-line range searching Discrete Comput. Geom. 17 1997 53 65 (Pubitemid 127347956)
10. B. Chazelle, and L.J. Guibas Fractional cascading: I. A data structuring technique Algorithmica 1 3 1986 133 162 (Pubitemid 17556682)
11. D.Z. Chen, and O. Daescu Space-efficient algorithms for approximating polygonal curves in two dimensional space Internat. J. Comput. Geom. Appl. 13 2 2003 95 112
12. L.P. Cordella, and G. Dettori An O (n) algorithm for polygonal approximation Pattern Recogn. Lett. 3 1985 93 97
13. M. de Berg, M. van Kreveld, and S. Schirra Topologically correct subdivision simplification using the bandwidth criterion Cartography and GIS 25 1998 243 257
14. 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 1973 112 122
15. R. Estkowski, and J.S.B. Mitchell Simplifying a polygonal subdivision while keeping it simple Proc. 17th ACM Symposium on Computational Geometry 2001 40 49 (Pubitemid 32865844)
16. D. Eu, and G.T. Toussaint On approximation polygonal curves in two and three dimensions CVGIP: Graphical Models and Image Processing 56 3 1994 231 246
17. L.J. Guibas, J.E. Hershberger, J.S.B. Mitchell, and J.S. Snoeyink Approximating polygons and subdivisions with minimum link paths Internat. J. Comput. Geom. Appl. 3 4 1993 383 415
18. S.L. Hakimi, and E.F. Schmeichel Fitting polygonal functions to a set of points in the plane CVGIP: Graphical Models and Image Processing 53 2 1991 132 136
19. logn) time Proc. 5th International Workshop on Algorithms and Data Structures 1997 93 103 (Pubitemid 127109886)
20. H. Imai, and M. Iri Computational-geometric methods for polygonal approximations of a curve Computer Vision, Graphics and Image Processing 36 1986 31 41 (Pubitemid 17462613)
21. H. Imai, and M. Iri An optimal algorithm for approximating a piecewise linear function J. Inform. Process. 9 3 1986 159 162 (Pubitemid 17572795)
22. H. Imai, and M. Iri Polygonal approximations of a curve-formulations and algorithms Computational Morphology 1988 North-Holland Amsterdam 71 86
23. A. Melkman, and J. O'Rourke On polygonal chain approximation Computational Morphology 1988 North-Holland Amsterdam 87 95
24. B.K. Natarajan, On comparing and compressing piecewise linear curves, Technical Report, Hewlett Packard, 1991
25. B.K. Natarajan, and J. Ruppert On sparse approximations of curves and functions Proc. 4th Canadian Conference on Computational Geometry 1992 250 256
26. G.T. Toussaint On the complexity of approximating polygonal curves in the plane Proc. IASTED International Symp. on Robotics and Automation, Lugano, Switzerland 1985