Exploiting Triangulated Surface Extraction Using Tetrahedral Decomposition

IEEE Transactions on Visualization and Computer Graphics

Volumn 1, Issue 4, 1995, Pages 328-342

  Guéziec, André ^a   Hummel, Robert ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

B rep; boundary representation; homology theory; lossless surface compression; Marching Cubes; surface curvature; surface simplification; tetrahedral decomposition

Indexed keywords

ALGORITHMS; COMPUTERIZED TOMOGRAPHY; DATA STRUCTURES; GEOMETRY; GRAPH THEORY; IMAGE CODING; IMAGE COMPRESSION; MAGNETIC RESONANCE IMAGING; SURFACES;

BOUNDARY REPRESENTATION; HOMOLOGY THEORY; LOSSLESS SURFACE COMPRESSION; MARCHING CUBES; SURFACE CURVATURE; SURFACE SIMPLIFICATION; TETRAHEDRAL DECOMPOSITION; TRIANGULATED SURFACE EXTRACTION;

FEATURE EXTRACTION;

EID: 0029485130     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/2945.485620     Document Type: Article

References (34)

1. N. Ayache, A. Guéziec, J.P. Thirion, and A. Gourdon, “Evaluating 3D registration of CT-scan images using crest lines,” Proc. Mathematical Methods in Medical Imaging II, vol. 2,035–06, pp. 60–71, San Diego, July 14–15, 1993.
2. H.H. Baker, “Building surfaces of evolution: The weaving wall,” Int'l J. Computer Vision, vol. 3, pp. 51–71, 1989.
3. B.G. Baumgart, “Geometric modeling for computer vision,” PhD thesis, Stanford Univ., 1974.
4. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MacGraw Hill, 1989.
5. A. Doi and A. Koide, “An efficient method of triangulating equi-valued surfaces by using tetrahedral cells,” IEICE Trans., vol. E74, no. 1, pp. 214–224, Jan. 1991.
6. A. Guéziec and D. Dean, “The wrapper algorithm: A surface optimization algorithm that preserves highly curved areas,” Proc. Second Conf. Visualization in Biomedical Computing, pp. 631–642, Rochester, Minn., Oct. 4–7, 1994.
7. M.J. Greenberg, Lectures on Algebraic Topology, Mathematics Lecture Note Series. Reading, Mass.: W.A. Benjamen, 1967.
8. A. Guéziec, “Surface representation with deformable splines: Using decoupled variables,” IEEE Computational Science and Engineering, vol. 2, no. 1, Mar. 1995.
9. A. Guéziec, “Surface simplification with variable tolerance,” Proc. Second Ann. Int'l Symp. Medical Robotics and Computer Assisted Surgery, Baltimore, Nov. 1995.
10. B. Hamann, “Modeling contours of trivariate data,” Mathematical Modelling and Numerical Analysis, vol. 26, no. 1, pp. 51–517, 1992.
11. B. Hamann, “Curvature approximation for triangulated surfaces,” Geometric Modelling, G. Farin, H. Hagen, and H. Noltemeier, eds., Computing Suppl. 8, pp. 139–153. New York: Springer-Verlag, 1993.
12. B. Hamann, “A data reduction scheme for triangulated surfaces,” Computer Aided Geometric Design, vol. 11, no. 2, pp. 197–214, 1994.
13. H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle, “Mesh optimization,” Proc. ACM Siggraph, pp. 19–25, Anaheim, Calif., July 1993.
14. R.A. Hummel, “Connected components labelling in image processing with MMD architectures,” Intermediate-Level Image Processing, chap. 7, pp. 101–127. Academic Press, 1986.
15. M. Hall and J. Warren, “Adaptive polygonalization of implicitly defined surfaces,” IEEE Computer Graphics and Applications, vol. 10, no. 6, pp. 33–42, Nov. 1990.
16. A. Kalvin, “Segmentation and surface-based modeling of objects in three-dimensional biomedical images,” PhD thesis, New York Univ., June 1991.
17. D.B. Karron, “The ‘SpiderWeb’ algorithm for surface construction in noisy volume data,” Proc. Visualization in Biomedical Computing '92, vol. 1,808, pp. 462–476, 1992.
18. A. Kalvin, C. Cutting, B. Haddad, and M. Noz, “Constructing topologically connected surfaces for the comprehensive analysis of 3D medical structures,” Proc. Medical Imaging V: Image Processing, vol. 1,445, pp. 247–258, Bellingham, Wash., Oct. 1991.
19. A. Koide, A. Doi, and K. Kajioka, “Polyhedral approximation approach to molecular orbital graphics,” J. Molecular Graphics, vol. 4, pp. 149–160, 1986.
20. A.D. Kalvin and R.H. Taylor, “Superfaces: Polyhedral approximation with bounded error,” Technical Report, IBM T.J. Watson Research Center, Yorktown Heights, N.Y., 1993.
21. W.E. Lorenson and H.E. Cline, “Marching cubes: A high resolution 3D surface construction algorithm,” Proc. ACM Siggraph, vol. 21–4, pp. 163–169, Anaheim, Calif., July 1987.
22. G. Malandain, N. Ayache, and G. Bertrand, “Topological segmentation of discrete surfaces,” Int'l J. Computer Vision, vol. 10, no. 2, pp. 183–197, 1993.
23. O. Monga, S. Benayoun, and O. Faugeras, “Using third order derivatives to extract ridge lines in 3D images,” Proc. Conf. Vision and Pattern Recognition. Urbana-Champaign, Ill., June 1992.
24. P. Ning and J. Bloomenthal, “An evaluation of implicit surface tilers,” IEEE Computer Graphics and Applications, vol. 13, no. 6, pp. 33–34, Nov. 1993.
25. G. Nielson and B. Hamann, “The asymptotic decider. Resolving the ambiguity in marching cubes,” Proc. Conf. Visualization, pp. 83–91, 1991.
26. B.A. Payne and A.W. Toga, “Surface mapping brain function on 3D models,” IEEE Computer Graphics and Applications, vol. 10, no. 5, pp. 33–41, Sept. 1990.
27. R. Ronfard and J. Rossignac, “Simplifying a triangular mesh with multiple planar constraints,” Technical Report, IBM T.J. Watson Research Center, Yorktown Heights, N.Y., 1994.
28. L.L. Schumaker, “Triangulations in CAGD,” IEEE Computer Graphics and Applications, vol. 13, no. 1, pp. 47–52, Jan. 1993.
29. W. Schroeder, J. Zarge, and W.E. Lorensen, “Decimation of triangular meshes,” Proc. ACM Siggraph, vol. 26–2, pp. 65–70, July 1992.
30. J.P. Thirion and A. Gourdon, “The marching line algorithm: New results and proofs,” Technical Report 1991, INRIA, Sophia Antipolis, France, 1993.
31. G. Taubin and R. Ronfard, “Implicit simplicial models I: Adaptive curve reconstruction,” Technical Report, IBM T.J. Watson Research Center, Yorktown Heights, N.Y., 1993.
32. G. Turk, “Retiring polygonal surfaces,” Proc. ACM Siggraph, vol. 26–2, p. 55,064, July 1992.
33. A. Wallin, “Constructing isosurfaces from CT data,” IEEE Computer Graphics and Applications, vol. 11, no. 6, pp. 28–33, Nov. 1991.
34. G. Wyvill, C. McPheeters, and B. Wyvill, “Data structure for soft objects,” Visual Computer, vol. 2, pp. 227–234, 1986.