Skip to main content
SpringerLink
Log in

A fast voxelization algorithm for trilinearly interpolated isosurfaces

  • Original Article
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

In this work, we propose a new method for a fast incremental voxelization of isosurfaces obtained by the trilinear interpolation of 3D data. Our objective consists in the fast generation of subvoxelized isosurfaces extracted by a point-based technique similar to the Dividing Cubes algorithm. Our technique involves neither an exhaustive scan search process nor a graph-based search approach when generating isosurface points. Instead an optimized incremental approach is adopted here for a rapid isosurface extraction. With a sufficient sampling subdivision criteria around critical points, the extracted isosurface is both correct and topologically consistent with respect to the piecewise trilinear interpolant. Furthermore, the discretization scheme used in our method ensures obtaining thin - one voxel width - isosurfaces as compared to the one given by the Dividing Cubes algorithm. The resultant subvoxelized isosurfaces are efficiently tested against all possible configurations of the trilinear interpolant and real-world datasets.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Carr, H., Max, N.: Subdivision analysis of the trilinear interpolant. IEEE Trans. Vis. Comput. Graph. 16, 533–547 (2010)

    Article  Google Scholar 

  2. Nielson, M.G.: On marching cubes. IEEE Trans. Vis. Comput. Graph. 9, 283–297 (2003)

    Article  Google Scholar 

  3. Lopes, A., Brodlie, K.: Improving the robustness and accuracy of the marching cubes algorithm for isosurfacing. IEEE Trans. Vis. Comput. Graph. 9, 19–29 (2003)

    Article  Google Scholar 

  4. Sreevalsan-Nair, J., Linsen, L., Hamann, B.: Using ray intersection for dual isosurfacing. Int. Conf Comput. Graph. Theory Appl. (2006)

  5. Natarajan, B.K.: On generating topologically consistent isosurfaces from uniform samples. Vis. Comput. 11, 52–62 (1994)

    Article  Google Scholar 

  6. Lorensen, W.E., Cline, H.E.: Marching cubes: a high resolution 3D surface construction algorithm. Comput. Graph. 21, 163–169 (1987)

    Article  Google Scholar 

  7. Cline, H.E., Lorensen, W.E., Ludke, S., Crawford, C.R., Teeter, B.C.: Two algorithms for three-dimensional reconstruction of tomograms. Med. Phys. 15, 320–327 (1988)

    Article  Google Scholar 

  8. Chernyaev, E.V.: Marching Cubes 33: construction of topologically correct isosurfaces. Technical Report CERN CN 9517 (1995)

  9. Custodio, L., Etiene, T., Pesco, S., Silva, C.: Practical considerations on marching cubes 33 topological correctness. Comput. Graph. 37, 840–850 (2013)

    Article  Google Scholar 

  10. Newman, T.S., Yi, H.: A survey of the marching cubes algorithm. Comput. Graph. 30, 854–879 (2006)

    Article  Google Scholar 

  11. Bresenham, J.E.: Algorithm for computer control of a digital plotter. IBM Syst. J. 4, 25–30 (1965)

    Article  Google Scholar 

  12. Liu, X.-W., Cheng, K.: Three-dimentional extension of Bresenhams algorithm and its application in straight-line interpolation. Proc. Inst. Mech. Eng. 216, 459–463 (2002)

    Article  Google Scholar 

  13. Boumghar, F.O., Miguet, S., Nicod, J.M.: Complexity of discrete surfaces in the dividing-cubes algorithm. DGCI 1996, LNCS Springer, New York, pp 269–280 (1996)

  14. Kebaili, A., Boumghar, F.: Optimal blocs subdivision in the “Dividing-cubes” algorithm. Application to the 3D medical imagery. In: Proceedings of MGV vol. 9, pp 281–288 (2000)

  15. Bong-Soo, S.: Topology preserving tetrahedral decomposition applied to trilinear interval volume tetrahedrization. KSII Trans. Int. Inf. Syst. 3, 667–681 (2009)

    Google Scholar 

  16. Theisel, H.: Exact isosurfaces for marching cubes. Comput. Graph. Forum 21, 19–31 (2002)

    Article  MATH  Google Scholar 

  17. Hamann C.B., Joy K.I.: Iso-splatting: a point-based alternative to isosurface visualization. In: Proceedings of Computer Graphics and Applications, pp. 325–334 (2003)

  18. Livnat Y., Tricoche X.: Interactive point-based isosurface extraction. In: Proceedings of Visualization 04, Austin, pp. 457–464 (2004)

  19. Zhang, H., Kaufman, A.: Interactive point-based isosurface exploration and high-quality rendering. IEEE Trans. Vis. Comput. Graph. 12, 1267–1274 (2006)

    Article  Google Scholar 

  20. Guanfeng J., Han-Wei S., Jinzhu G.: Interactive exploration of remote isosurfaces with point-based non-photorealistic rendering. In: Proceedings of IEEE Pacific Visualization Symposium, pp. 25–32 (2008)

  21. Kong, T.Y., Rosenfeld, A.: Digital topology: introduction and survey. J. Comput. Vis. Graph. Image Process. 48, 357–393 (1989)

    Article  Google Scholar 

  22. Jonas, A., Kiryati, N.: Digital representation schemes for 3D curves. Pattern Recogn. 30, 1803–1816 (1997)

    Article  Google Scholar 

  23. DGtal: Discrete Geometry Tools and Algorithms. http://dgtal.org. Accessed 8 Oct 2012

Download references

Acknowledgments

These results were obtained during an 18 months internship in LIRIS Laboratory, Lyon2 University of France. Therefore, we would like to express our gratitude to all the members of the LIRIS-M2DisCo team for their valuable feedback and guidance that helped us significantly throughout this work. The work was funded by Algerian Ministry of Higher Education and Research.

Author information

Authors and Affiliations

  1. Institute of Electrical and Electronic Engineering, University M’hamed Bougara Boumerdes (UMBB), Boumerdes, Algeria

    Rachid Namane

  2. LRPE Laboratory, ParIMed Team, Computer Science and Electronics Faculty, University of Sciences and Technology Houari Boumediene (USTHB), Algiers, Algeria

    Rachid Namane & Fatima Boumghar Oulebsir

  3. LIRIS Laboratory, Lyon 2 University, Lyon, France

    Serge Miguet

Authors
  1. Rachid Namane
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Serge Miguet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fatima Boumghar Oulebsir
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rachid Namane.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Namane, R., Miguet, S. & Oulebsir, F.B. A fast voxelization algorithm for trilinearly interpolated isosurfaces. Vis Comput 34, 5–20 (2018). https://doi.org/10.1007/s00371-016-1306-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00371-016-1306-0

Keywords

Search

Navigation