Multiple material marching cubes algorithm

International Journal for Numerical Methods in Engineering

Volumn 58, Issue 2, 2003, Pages 189-207

  Wu, Ziji ^a   Sullivan Jr , John M ^b  

^a DARTMOUTH COLLEGE   (United States)

^b Worcester Polytechnic Institute   (United States)

Author keywords

Marching cubes; Multi material; Surface adjustment; Surface reconstruction

Indexed keywords

ALGORITHMS; BIOMEDICAL ENGINEERING; MEDICAL IMAGING;

MARCHING CUBES ALGORITHMS;

NUMERICAL METHODS;

MATHEMATICAL MODELING;

EID: 0041641721     PISSN: 00295981     EISSN: None     Source Type: Journal    
DOI: 10.1002/nme.775     Document Type: Article

References (23)

1. Lorensen WE, Cline HE. Marching cubes: a high resolution 3D surface construction algorithm. Computer Graphics 1987; 21:163-169.
2. Schroeder W, Martin K, Lorensen B. The Visualization Toolkit. Prentice-Hall: Englewood Cliffs, NJ, 1997; ISBN 0-13-954694-4.
3. Bourke P. Polygonising a scalar field. http://www.swin.edu.au/astronomy/pbouke/modelling/polygonise/, valid January 2002.
4. Nielson GM, Hamann B. The asymptotic decide: resolving the ambiguity in marching cubes. IEEE Proceedings of the Visualization Congress 1991; San Diego, CA, 83-91.
5. Matveyev SV. Approximation of isosurface in the marching cube: ambiguity problem. IEEE Proceedings of the Visualization Congress 1994; 288-292.
6. Mantani C, Scateni R, Scopigno R. Discritized marching cubes. IEEE Proceedings of the Visualization Congress 1994; Washington, DC, 281-287.
7. Gueziec A, Hummel R. Exploiting triangulated surface extraction using tetrahedral decomposition. IEEE Transactions on Visualization and Computer Graphics 1995; 1(4):328-342.
8. Li J, Agathoklis P. An efficiency enhanced isosurface generation algorithm for volume visualization. The Visual Computer 1997; 13:391-400.
9. Lucas L. Gillard D, Remion Y. A new unsupervised cube-based algorithm for iso-surface generation. Computer Networks and ISDN Systems 1997: 29:1737-1744.
10. Chan SL, Purisima EO. A new tetrahedral tessellation scheme for isosurface generation. Computers and Graphics 1998; 22(1):83-90.
11. Treece GM, Prager RW, Gee AH. Regularised marching tetrahedral: improved iso-surface extraction. Computers and Graphics 1999; 23:583-598.
12. Wu Z. Accurate and efficient three-dimensional mesh generation for biomedical engineering applications. Ph.D. dissertation, Worcester Polytechnic Institute, 2001.
13. The Visible Human Project. http://www.nlm.nih.gov/research/visible/visible_human.html, valid January 2002.
14. Kulkarni AA. Surface model creation for biomedical applications using a marching cubes technique. M.S. Thesis, Worcester Polytechnic Institute, 2000.
15. Vollmer J, Mencl R, Müller H. Improved Laplacian smoothing of noisy surface meshes. Computer Graphics Forum l999; 18:131-138.
16. Amenta N, Bern M, Eppstein D. Optimal point placement for mesh smoothing. 8th ACM-SIAM Symposium on Discrete Algorithms, 1997.
17. Canann S, Stephenson M, Blacker T. Optismoothing: an optimization-driven approach to mesh smoothing. Finite Elements in Analysis and Design 1993; 13:185-190.
18. Taubin G. A signal processing approach to fair surface design. SIGGRAPH 1995; Los Angeles, CA, 351-358.
19. Schneider R, Kobbelt L. Geometric fairing of irregular meshes for free-form surface design. Computer Aided Geometric Design 2001; 18:359-379.
20. Shekhar R, Fayyad E et al. Octree-based decimation of marching cubes surfaces. IEEE Visualization Conference 1996; San Francisco, CA, 335-342.
21. Schroeder W, Zarge J, Lorensen W. Decimation of triangle meshes. Computer Graphics 1992; 26(2):65-70.
22. Erikson C. Polygonal simplification: an overview. Technical Report TR96-016, Department of Computer Science, University of North Carolina, Chapel Hill, 16 February 1996.
23. Cignoni P, Montani C, Scopigno R. A comparison of mesh simplification algorithms. Computers and Graphics 1998; 22(1):37-54.