Share Email Print
cover

Proceedings Paper

High-resolution triangulation of arbitrary shaped surfaces based on coordinate curves
Author(s): Bijan Timsari
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

A new method is proposed for building a polyhedral mesh form a set of planar contours representing coordinate constant slices of an object. This method can be used for extracting a boundary surface from volumetric data, a typical application of which is surface reconstruction for objects imaged by CT. With a computational complexity and processing time comparable to those of the Marching Cubes algorithm, an alternative method for extracting iso-surfaces from CT images, this method creates a surface with half of the number of triangles required by Marching Cubes without sacrificing for the accuracy of the surface. This algorithm begins with identifying boundary vertices in three sets of mutually perpendicular planes through the volumetric image data. Using the neighborhood relationship between the vertices in each plane the 3D neighborhood structure of the surface is determined, and either 4 or 6 neighbors are assigned to each vertex. The surface is then tiled with triangles by joining each vertex to two of its immediate neighbors. We applied this method to both computer generated phantom data, and real MR images of human head and compared the result with those of the Marching Cubes algorithm. The experiments show that the proposed method creates more regular and uniform triangulation with smaller number of triangles.

Paper Details

Date Published: 16 March 2000
PDF: 8 pages
Proc. SPIE 3958, Three-Dimensional Image Capture and Applications III, (16 March 2000); doi: 10.1117/12.380035
Show Author Affiliations
Bijan Timsari, Univ. of Southern California (United States)


Published in SPIE Proceedings Vol. 3958:
Three-Dimensional Image Capture and Applications III
Brian D. Corner; Joseph H. Nurre, Editor(s)

© SPIE. Terms of Use
Back to Top