Share Email Print
cover

Proceedings Paper

3D image modeling based on data-dependent tetrahedrization
Author(s): Kun Lee; Ohbong Gwun
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

3-D image modeling of volumetric data can be useful to biomedical research, medical therapy, surgery planning, and simulation of critical surgery (i.e. cranio-facial). This paper proposes an algorithm which is based on a tetrahedral domain instead of cubes. The initial tetrahedral domain is constructed by using Delaunay tetrahedrization algorithm. In the case of ambiguity, asymptotic decider is used instead of sphere criterion. In sphere criterion, only positional information is considered, by asymptotic decider allows to count the functional information. In other words, the construction of the tetrahedral domain is based on whether or not connecting vertices are joined by a component of the hyperbolic arc. Linear trivariate interpolation is performed through the tetrahedral domain. We call this new algorithm Marching Tetrahedra for the purpose of comparing it to Marching Cubes algorithm. The main difference between two algorithms is that tetrahedra are used, instead of cubes, in the process. Marching Tetrahedra algorithm allows the scattered data which can't be accepted by Marching Cubes algorithm.

Paper Details

Date Published: 23 September 1999
PDF: 14 pages
Proc. SPIE 3811, Vision Geometry VIII, (23 September 1999); doi: 10.1117/12.364092
Show Author Affiliations
Kun Lee, Handong Univ. (South Korea)
Ohbong Gwun, Chonbuk National Univ. (South Korea)


Published in SPIE Proceedings Vol. 3811:
Vision Geometry VIII
Longin Jan Latecki; Robert A. Melter; David M. Mount; Angela Y. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top