Skip to main content
Springer Nature Link
Log in

Optimal multiresolution polygonal approximation

  • Session 2: Computational Geometry
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1997)

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

Included in the following conference series:

  • 117 Accesses

Abstract

A polygonal curve can be described using different levels of resolutions (multiresolution). Progressive transmission allows a coarse rendition of a polygonal curve to be sent first to give the receiver an early impression of content (low-level resolution); then subsequent transmission provides progressively finer details (high-level resolution). In this paper, a novel polygonal curve approximation scheme is proposed, based on convolving a weighting function W on the polygonal curve. Our scheme, besides supporting multiresolution and progressive transmission, also satisfies the following properties: (1) optimal approximation, i.e. minimum mean square error, (2) low communication complexity, (3) fixed reduction ratio between levels, (4) efficient encoding, and (5) fast decoding. Experiments show that data compression can also be achieved.

This research is supported by RGC Research Grant HKU541/96E.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Alt, M. Godau, “Measuring the resemblance of polygonal curves”, Proc. 8th Annu. ACM Symp. on Computational Geometry, pp. 102–109, 1992.

    Google Scholar 

  2. M. Berg, K. T. G. Dobrindt, “On Levels of Detail in Terrains”, Technical Report, Utrecht University, 1995.

    Google Scholar 

  3. P. J. Burt, “Fast Filter Transforms for Image Processing=”, Computer Graphics and Image Processing, vol. 16, pp. 20–51, 1981.

    Google Scholar 

  4. W. S. Chan, F. Chin, “Approximation of Polygonal Curves with Minimum Number of Line Segments or Minimum Error”, Intl. J. of Computational Geometry and Applications, vol. 6, no. 1, pp. 59–77, 1996.

    Google Scholar 

  5. W. S. Chan, F. Chin, “Difficulties in Approximation of Polygonal Curves”, Proc. 1994 Intl. Workshop on Discrete Mathematics and Algorithms, 1994.

    Google Scholar 

  6. F. Chin, A. Choi, Y. Luo, “Optimal Generating Kernels for Image Pyramids by Piecewise Fitting”, IEEE Trans. PAMI, vol. 14, no. 12, pp. 1190–1198, 1992.

    Google Scholar 

  7. H. Edelsbrunner, “Finding Transversals for a set of Simple Geometric Figures”, Theoretical Computer Science, vol 35, p.55–69, 1985.

    Google Scholar 

  8. P. Egyed, R. Wenger, “Ordered stabbing of pairwise disjoint convex sets in linear time”, Discrete Applied Mathematics, 31, pp. 133–140, 1991

    Google Scholar 

  9. M.T. Goodrich, “Efficient Piecewise-linear-Function Approximation using the Uniform Metric”, Proc. 10th Annu. ACM Symp. on Computational Geometry, pp. 322–331, 1994.

    Google Scholar 

  10. L.J. Guibas, J.E. Hershberger, J.S.B. Mitchell and J.S. Snoeyink, “Approximating Polygons and Subdivisions with minimum-link paths”, Intl. J. of Computational Geometry and Applications, pp. 383–415, 1993.

    Google Scholar 

  11. 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) pp. 132–136, 1991.

    Google Scholar 

  12. J. Hershberger, J. Snoeyink, “An O(n log n) Implementation of the Douglas-Peucker Algorithm for Line Simplification”, Proc. 10th Annu. Symp. on Computational Geometry, pp. 383–384, 1994.

    Google Scholar 

  13. H. Imai and M. Iri, “Polygonal Approximation of a Curve-Formulations and Algorithms”,Computational Morphology, pp. 71–86, 1988.

    Google Scholar 

  14. Z. Li, S. Openshaw, “Algorithms for automated line generalization based on a natural principle of objective generalization”, Intl. J. of Geographical Information Systems, vol. 6, no. 5, pp. 373–389, 1992.

    Google Scholar 

  15. P. Meer, E. S. Baughter, A. Rosenfeld, “Frequency Domain Analysis and Synthesis of Image Pyramid Generating Kernels”, IEEE Trans. on PAMI, vol. 9, pp. 512–522, 1987.

    Google Scholar 

  16. D.P. Wang, N.F. Huang, H.S. Chao and R.C.T. Lee, “Plane Sweep Algorithms for polygonal approximation problems with applications”, Proc. 4th ISAAC, Lecture Notes in Computer Science, vol. 762, pp. 515–522, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Hong Kong, Hong Kong

    K. W. Chan & Francis Y. L. Chin

Authors
  1. K. W. Chan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francis Y. L. Chin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tao Jiang D. T. Lee

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chan, K.W., Chin, F.Y.L. (1997). Optimal multiresolution polygonal approximation. In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045070

Download citation

  • DOI: https://doi.org/10.1007/BFb0045070

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63357-0

  • Online ISBN: 978-3-540-69522-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics