Skip to main content
SpringerLink
Log in

Line segmentation of digital curves in parallel

  • Conference paper
  • First Online:
STACS 95 (STACS 1995)

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

Included in the following conference series:

Abstract

Partitioning digital curves into digital straight line segments (DLS) is important in several branches of image processing. We present a parallel algorithm for this task which runs in O(log n) time using O(nlog2 n) operations on a CREW PRAM. In contrast to earlier sequential algorithms it is not founded on number-theoretic properties of digital lines, instead we only use geometrical tools. The main observation for obtaining our complexity bounds is that the convex hull of a DLS of length n has O(log n) vertices. We also construct a sequence of DLS showing that this bound is tight.

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. T.A. Anderson, C.E. Kim: Representation of digital line segments and their preimages, Comp. Vision, Graphics, and Image Proc. 30 (1985), 279–288

    Google Scholar 

  2. M.J. Atallah, M.T. Goodrich: Parallel algorithms for some functions of two convex polygons, Algorithmica 3 (1988), 535–548

    Google Scholar 

  3. E. Creutzburg, A. Hübler, V. Wedler: Decomposition of digital arcs and contours into a minimal number of digital line segments (abstract), Proc. 6th Int. Conf. on Pattern Recognition, Munich 1982, 1218

    Google Scholar 

  4. I. Debled-Rennesson, J.P. Reveillès: A linear algorithm for segmentation of digital curves, 3rd Int. Workshop on Parallel Image Analysis, College Park/MD 1994

    Google Scholar 

  5. L. Dorst, A.W.M. Smeulders: Decomposition of discrete curves into piecewise segments in linear time, Contemporary Math. 119 (1991), 169–195

    Google Scholar 

  6. V.A. Kovalesky: New definition and fast recognition of digital straight segments and arcs, 10th Int. Conf. on Pattern Recognition, Atlantic City/NJ 1990

    Google Scholar 

  7. S. Pham: On the boundary of digital straight line segments, in: T.I. Kunii (ed.), Advanced Computer Graphics, Proc. Computer Graphics, Tokyo 1986, Springer, 79–109

    Google Scholar 

  8. J.P. Reveillès: Géométrie discrète, calcul en nombres entiers et algorithmique, Thèse d'Etat, Univ. Louis Pasteur, Strasbourg 1991

    Google Scholar 

  9. A. Rosenfeld: Digital straight line segments, IEEE Trans. on Comp. 23 (1974), 1264–1269

    Google Scholar 

  10. A. Trœsch: Interprétation géométrique de l'algorithme d'Euclide et reconnaissance des segments, Theor. Computer Science 115 (1993), 291–319

    Google Scholar 

  11. L.D. Wu: On the chain code of a line, IEEE Trans. PAMI 4 (1982), 347–353

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Theoretische Informatik II, Fern Universität, 58084, Hagen, Germany

    Peter Damaschke

Authors
  1. Peter Damaschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ernst W. Mayr Claude Puech

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Damaschke, P. (1995). Line segmentation of digital curves in parallel. In: Mayr, E.W., Puech, C. (eds) STACS 95. STACS 1995. Lecture Notes in Computer Science, vol 900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_103

Download citation

  • DOI: https://doi.org/10.1007/3-540-59042-0_103

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59042-2

  • Online ISBN: 978-3-540-49175-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation