Skip to main content

Surface Traversing and Encoding in 3D Images

  • Chapter
  • First Online:
Image Processing with Cellular Topology
  • 189 Accesses

Abstract

This chapter describes two algorithms of traversing surfaces in 3D images and the theory of subdividing a surface into digital plane patches (DPP). The algorithm “SpiralTracing” is the only known algorithm which can encode a surface as a sequence of adjacent facets while other algorithms encode a surface as a not ordered set of facets. So does the here described algorithm “CORB_3D”. This chapter also describes the theory of digital plane patches.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 159.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 159.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Rosenfeld A, Kong Y, Wu A. Digital Surfaces. CVGIP, Graphical Models. 1991;53:305–12.

    Article  Google Scholar 

  2. Gordon D, Udupa JK. Fast surface tracking in three-dimensional binary images. CVGIP. 1989;45:196–214.

    Google Scholar 

  3. Aho AV, Hopcroft JH, Ullman JD. The design and analysis of algorithms. Reading: Addison-Wesley; 1974.

    MATH  Google Scholar 

  4. Kovalevsky V. Geometry of locally finite spaces. Editing house Dr. Bärbel Kovalevski, Berlin; 2008. ISBN 978-3-9812252-0-4

    Google Scholar 

  5. Kong TY. On boundaries and boundary crack codes in multidimensional digital images. In: Shape in picture. Springer; 1994. p. 71–80.

    Chapter  Google Scholar 

  6. Urbanek C. Visualizing of the Kovalevsky’s algorithm for surface presentation. Master thesis: University of Applied Sciences, Berlin; 2003.

    Google Scholar 

  7. Kovalevsky V. A topological method of surface representation. In: Bertrand G, Couprie M, Perroton L, editors. DGCI, LNSC 1568; 1999. p. 118–35.

    Google Scholar 

  8. Klette R, Sun HJ. Digital planar segment based Polyhedrization for surface area estimation. In: Proc. visual form 2001. LNCS 2059; 2001. p. 356–66.

    Google Scholar 

  9. Reveilles JP. Géométrie discrète, calcul en nombres entier et algorithmique. Thèse d’état: Université Louis Pasteur, Strasbourg; 1991.

    MATH  Google Scholar 

  10. Kozinets BN. An iteration-algorithm for separating the convex hulls of two sets. In: Vapnik VN, editor. Lerning algorithms for pattern recognition (in Russian language). Moscow: Publishing house “Sovetskoe Radio”; 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Kovalevsky, V. (2021). Surface Traversing and Encoding in 3D Images. In: Image Processing with Cellular Topology. Springer, Singapore. https://doi.org/10.1007/978-981-16-5772-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-5772-6_7

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-5771-9

  • Online ISBN: 978-981-16-5772-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics