Share Email Print

Proceedings Paper

A new modeling algorithm for implicit surface polygonalization
Author(s): Yongjian Xi; Greg Heckenberg; Ye Duan; Hongkai Zhao
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

We propose a new implicit surface polygonalization algorithm based on front propagation. The algorithm starts from a simple seed (e.g. a triangle) that can be automatically initialized, and always enlarges its boundary contour outwards along its tangent direction suggested by the underlying volume data. Our algorithm can conduct mesh optimization and Laplacian smoothing on-the-fly and generate meshes of much higher quality than the Marching-cubes algorithm. Experimental results on both real and synthetic volumetric datasets are shown to demonstrate the robustness and effectiveness of the new algorithm.

Paper Details

Date Published: 17 January 2005
PDF: 8 pages
Proc. SPIE 5675, Vision Geometry XIII, (17 January 2005); doi: 10.1117/12.585678
Show Author Affiliations
Yongjian Xi, Univ. of Missouri/Columbia (United States)
Greg Heckenberg, Univ. of Missouri/Columbia (United States)
Ye Duan, Univ. of Missouri/Columbia (United States)
Hongkai Zhao, Univ. of California/Irvine (United States)

Published in SPIE Proceedings Vol. 5675:
Vision Geometry XIII
Longin Jan Latecki; David M. Mount; Angela Y. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top