An adaptive and efficient algorithm for polygonization of implicit surfaces

Authors:
Mingyong Pang;Zhigeng Pan;Mingmin Zhang;Fuyan Zhang
Affiliations:
Department of Computer Science and Technology, Nanjing University, Nanjing, P. R. China;State Key Lab of CAD&CG, Zhejiang University, HangZhou, P. R. China;State Key Lab of CAD&CG, Zhejiang University, HangZhou, P. R. China;Department of Computer Science and Technology, Nanjing University, Nanjing, P. R. China
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Year:
2005

Citing 7
Cited 0

Polygonization of implicit surfaces

Computer Aided Geometric Design
Re-tiling polygonal surfaces

SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Interval arithmetic recursive subdivision for implicit functions and constructive solid geometry

SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Physically-based methods for polygonization of implicit surfaces

Proceedings of the conference on Graphics interface '92
An implicit surface polygonizer

Graphics gems IV
A Generalization of Algebraic Surface Drawing

ACM Transactions on Graphics (TOG)
Simple and efficient polygonization of implicit surfaces

Journal of Graphics Tools

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an adaptive and efficient algorithm for polygonization of implicit surfaces, which consists of two steps: initial polygonization and adaptive refinement. The algorithm first generates an initial coarse triangular mesh from implicit surface using a variation of the traditional Marching Cubes (MC) Algorithm. And then the triangles in the coarse mesh are iteratively subdivided by employing a sampling rate that varies spatially according to local complexity of the surface. The new created vertices in refined mesh are projected onto the implicit surface by gradient descent method. Consequently, the algorithm produces the minimum number of polygons required to approximate the surface with a desired precision and the final mesh is simplicial complex. Our algorithm can be used in the real-time environment of visualization of implicit surfaces.