Skip to main content
SpringerLink
Log in

Polygonal Path Approximation: A Query Based Approach

  • Conference paper
Algorithms and Computation (ISAAC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2906))

Included in the following conference series:

  • 1216 Accesses

Abstract

In this paper we present a new, query based approach for approximating polygonal chains in the plane. We give a few results related with this approach, some of more general interest, and propose a greedy heuristic to speed up the computation. We also give an O(nlogn) time, factor 2 approximation algorithm with infinite beam criterion. Finally, we show that the query based approach can be used to obtain a subquadratic time exact algorithm with infinite beam criterion and Euclidean distance metric if some condition on the input path holds.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal, P.K., Har-Peled, S., Mustafa, N., Wang, Y.: Near-linear time approximation algorithms for curve simplification. In: Proc. of 10th Annual European Sympos. Algorithms, pp. 29–41 (2002)

    Google Scholar 

  2. Agarwal, P.K., Varadarajan, K.R.: Efficient algorithms for approximating polygonal chains. Discrete Computational Geometry 23, 273–291 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Alt, H., Blomer, J., Godau, M., Wagener, H.: Approximation of convex polygons. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 703–716. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  4. Avis, D., ElGindy, H., Seidel, R.: Simple on-line algorithms for convex polygons. In: Toussaint, G.T. (ed.) Computational Geometry (1985)

    Google Scholar 

  5. Barequet, G., Chen, D.Z., Daescu, O., Goodrich, M.T., Snoeyink, J.: Efficiently approximating polygonal paths in three and higher dimensions. Algorithmica 33(2), 150–167 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Chazelle, B., Guibas, L.J.: Fractional cascading: I. A data structuring technique. Algorithmica 1, 133–162 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  7. Chazelle, B., Guibas, L.J.: Fractional cascading: II. Applications. Algorithmica 1, 163–191 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  8. Chan, W.S., Chin, F.: Approximation of polygonal curves with minimum number of line segments or minimum error. Intl. Journal of Computational Geometry and Applications 6(1), 59–77 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  9. Chen, D.Z., Daescu, O.: Space-efficient algorithms for approximating polygonal curves in two dimensional space. International Journal of Computational Geometry and Applications 13(2), 95–112 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Cordella, L.P., Dettori, G.: An O(n) algorithm for polygonal approximation. Pattern Recognition Letters 3, 93–97 (1985)

    Article  Google Scholar 

  11. Daescu, O.: New results on path approximation. Manuscript (2003)

    Google Scholar 

  12. de Berg, M., van Kreveld, M., Schirra, S.: Topologically correct subdivision simplification using the bandwidth criterion. Cartog. and GIS 25, 243–257 (1998)

    Article  Google Scholar 

  13. Estkowski, R., Mitchell, J.S.B.: Simplifying a polygonal subdivision while keeping it simple. In: Proc. 17th ACM Symp. on Comput. Geom., pp. 40–49 (2001)

    Google Scholar 

  14. Eu, D., Toussaint, G.T.: On approximation polygonal curves in two and three dimensions. CVGIP: Graphical Models and Image Processing 56(3), 231–246 (1994)

    Article  Google Scholar 

  15. 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(4), 383–415 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  16. Hakimi, S.L., Schmeichel, E.F.: Fitting polygonal functions to a set of points in the plane. CVGIP: Graphical Models and Image Processing 53(2), 132–136 (1991)

    Article  MATH  Google Scholar 

  17. Hurtado, F., Ramos, P., Noy, M., Seara, C.: Separating objects in the plane with wedges and strips. Discrete Applied Mathematics 109, 109–138 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  18. Imai, H., Iri, M.: Computational-geometric methods for polygonal approximations of a curve. Computer Vision, Graphics and Image Processing 36, 31–41 (1986)

    Article  Google Scholar 

  19. Imai, H., Iri, M.: An optimal algorithm for approximating a piecewise linear function. Journal of Information Processing 9(3), 159–162 (1986)

    MATH  MathSciNet  Google Scholar 

  20. Imai, H., Iri, M.: Polygonal approximations of a curve-formulations and algorithms. In: Comput. Morphology, pp. 71–86. North-Holland, Amsterdam (1988)

    Google Scholar 

  21. Melkman, A., O’Rourke, J.: On polygonal chain approximation. In: Computational Morphology, pp. 87–95. North-Holland, Amsterdam (1988)

    Google Scholar 

  22. Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge (1995)

    MATH  Google Scholar 

  23. Toussaint, G.T.: On the complexity of approximating polygonal curves in the plane. In: Proc. IASTED International Symp. on Robotics and Automation (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75080, USA

    Ovidiu Daescu & Ningfang Mi

Authors
  1. Ovidiu Daescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ningfang Mi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Science and Technology, Kwansei Gakuin University, Sanda, Japan

    Toshihide Ibaraki

  2. Department of Architecture and Architectural Engineering, Kyoto University, 615-8540, Nishikyo-ku, Kyoto, Japan

    Naoki Katoh

  3. Department of Computer Science and Communication Engineering, Kyushu University, 812-8581, Fukuoka, Japan

    Hirotaka Ono

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Daescu, O., Mi, N. (2003). Polygonal Path Approximation: A Query Based Approach. In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24587-2_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20695-8

  • Online ISBN: 978-3-540-24587-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation