Skip to main content

3D Object Reconstruction from Parallel Cross-Sections

  • Conference paper
Computer Vision and Graphics (ICCVG 2008)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 5337))

Included in the following conference series:

Abstract

The paper presents a novel approach to the contour stitching method which improves the reconstruction of 3D objects from parallel contours. The innovation assumes the construction of outer and inner contour from many contours on one cross-section in case of branching. This exchange allows easy one to one connection, between contours on adjoining cross-sections, which has already been defined. Additionally, such a definition permits from artificial holes generation. Moreover, the method takes care of smooth surface reconstruction in case of concave and convex shapes. The performance of the novel algorithm has been tested on the set of artificial data as well as on the set of data gathered from CT scans and proved it to work well.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Abdel-Malek, K., Blackmore, D., Joy, K.: Swept Volumes: Foundations, Perspectives and Applications. International Journal of Shape Modelling, http://www.engineering.uiowa.edu/~amalek/papers/swept-volume-review.pdf

  2. Abdel-Malek, K., Yang, J., Blackmore, D.: Closed-form Swept Volume of Implicit Surfaces. In: Proc. of ASME Design Engineering and Technical Conferences (2000), http://www.engineering.uiowa.edu/amalek/papers/DAC-14232-2000.pdf

  3. Bajaj, C., Coyle, E.J., Kun-Nan, L.: Arbitrary Topology Shape Reconstruction from Planar Cross Sections. Graphical Models and Image Processing, 524–543 (1996)

    Google Scholar 

  4. Barequet, G., Shapiro, D., Tal, A.: History Consideration in Reconstruction Polyhedral Surfaces from Parallel Slices. In: Proc. of Conference on Visualization, pp. 149–157 (1996)

    Google Scholar 

  5. Bourke, P.: Polygonising a Scalar Field (1994), http://local.wasp.uwa.edu.au/pbourke/geometry/polygonise

  6. Bourke, P.: Polygonising a Scalar Field Usign Tetrahedrons (1997), http://local.wasp.uwa.edu.au/~pbourke/geometry/polygonise

  7. Braude, I., Marker, J., Museth, K., Nissanov, J., Breen, D.: Contour-Based Surface Reconstruction using MPU Implicit Models. Elsevier Science Graphical Models, pp. 139–157 (2007)

    Google Scholar 

  8. Chernyaev, E.V.: Marching Cubes 33: Construction of Topologycally Correct Isosurfaces. Technical Report CERN CN 95-17 (1995), http://www.info.cern.ch/asdoc/./psdir/mc.ps.gz

  9. Delaunay, B.: Sur la sphére vide in Otdelenie Matematicheskikh i Estestvennykh Nauk (1934)

    Google Scholar 

  10. Galin, E., Akkouche, S.: Fast Surface Reconstruction from Contours using Implicit Surfaces. In: Implicit Surface Conference (1998)

    Google Scholar 

  11. Ganapathy, S., Dennehy, T.G.: A New General Triangulation Method for Planar Contours. In: ACM SIGGRAPH Computer Graphics, pp. 69–75 (1982)

    Google Scholar 

  12. Gueziec, A., Taubin, G., Lazarus, F.: Cutting and Stitching: Converting Sets of Polygons to Manifold Surfaces. IEEE Trans. on Vizualization and Computer Graphics (2001)

    Google Scholar 

  13. Keppel, E.: Approximating Complex Surfaces by Triangulation of Contour Lines. IBM, Resource Development, pp., 2–11 (1975)

    Google Scholar 

  14. Lin, C.-F., Yang, D.-L., Chung, Y.-C.: A Marching Voxels Method for Surface Rendering of Volume Data. In: Proc. of International Conference on Computer Graphics, pp. 306–313 (2001)

    Google Scholar 

  15. Lorensen, W.E., Cline, H.E.: Marching Cubes: A high resolution 3D surface construction algorithm. In: Proc. of 14th Conference on Computer Graphics and Interactive Technologies, pp. 163–169 (1987)

    Google Scholar 

  16. Nilsson, O., Breen, D., Museth, K.: Surface Reconstruction Via Contour Metamorphosis: an Eulerian Approach With Lagrangian Particle Tracking. In: Proc. of IEEE Visualization, pp. 407–414 (2005)

    Google Scholar 

  17. Nurzyska, K.: Static Methods for Object Reconstruction Overview: for Medical Diagnosis Use. In: 7th International Conference on Computer Science – Research and Application (in press) (2008)

    Google Scholar 

  18. Parker, J.R., Attia, E.N.: Object Reconstruction from Slices for Vision. In: Proc. of International Computer Graphics, pp. 58–64 (1999)

    Google Scholar 

  19. Schmidt, R., Wyvill, B.: Generalized Sweep Templates for Implicit Modeling. In: Proc. of 3rd International Conference on Computer Graphics and Interactive Techniques (2005), http://www.unknownroad.com/publications/SweepsGraphite05.pdf

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nurzyǹska, K. (2009). 3D Object Reconstruction from Parallel Cross-Sections. In: Bolc, L., Kulikowski, J.L., Wojciechowski, K. (eds) Computer Vision and Graphics. ICCVG 2008. Lecture Notes in Computer Science, vol 5337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02345-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02345-3_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02344-6

  • Online ISBN: 978-3-642-02345-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics