A new method for improving polygonizations of implicit surfaces with sharp features is proposed. The method is based on the observation that, given an implicit surface with sharp features, a triangle mesh whose triangles are tangent to the implicit surface at certain inner triangle points gives a better approximation of the implicit surface than the standard Marching Cubes mesh [Lorensen, W.E., and Cline, H.E., 1987, Computer Graphics (Proceedings of SIGGRAPH ’87), 21(3), pp. 163–169] (in our experiments we use VTK Marching Cubes [Schroeder, W., Martin, K., and Lorensen, W., 1998, The Visualization Toolkit: An Object-Oriented Approach to 3-D Graphics, Prentice Hall]). First, given an initial triangle mesh, its dual mesh composed of the triangle centroids is considered. Then the dual mesh is modified such that its vertices are placed on the implicit surface and the mesh dual to the modified dual mesh is considered. Finally the vertex positions of that “double dual” mesh are optimized by minimizing a quadratic energy measuring a deviation of the mesh normals from the implicit surface normals computed at the vertices of the modified dual mesh. In order to achieve an accurate approximation of fine surface features, these basic steps are combined with adaptive mesh subdivision and curvature-weighted vertex resampling. The proposed method outperforms approaches based on the mesh evolution paradigm in speed and accuracy.

1.
Lorensen, W. E., and Cline, H. E., 1987, “Marching Cubes: A High Resolution 3D Surface Construction Algorithm,” Computer Graphics (Proceedings of SIGGRAPH ’87), 21(3), pp. 163–169.
2.
Schroeder, W., Martin, K., and Lorensen W., 1998, The Visualization Toolkit: An Object-Oriented Approach to 3D Graphics, Prentice Hall.
3.
Bloomenthal, J., 1997, Introduction to Implicit Surfaces, J. Bloomenthal, editor, Morgan Kaufmann.
4.
Velho
,
L.
,
1996
, “
Simple and Efficient Polygonization of Implicit Surfaces
,”
Journal of Graphics Tools
,
1
(
2
), pp.
5
24
.
5.
Karkanis
,
T.
, and
Stewart
,
A. J.
,
2001
, “
Curvature-Dependent Triangulation of implicit surfaces
,”
IEEE Comput. Graphics Appl.
,
21
(
2
), pp.
60
69
.
6.
Ohtake, Yu, Belyaev, A. G., and Pasko, A., 2001, “Dynamic Meshes for Accurate Polygonization of Implicit Surfaces with Sharp Features,” in Shape Modeling International 2001, pp. 74–81.
7.
Kobbelt, L. P., Botsch, M., Schwanecke, U., and H.-P., Seidel, 2001, “Feature Sensitive Surface Extraction From Volume Data,” in Computer Graphics (Proceedings of SIGGRAPH 2001), pages 57–66.
8.
Ohtake, Yu, 2002, “Mesh Optimization and Feature Extraction,” Ph.D. thesis, University of Aizu.
9.
Ohtake, Yu, and Belyaev, A. G., 2002, “Dual/Primal Mesh Optimization for Polygonized Implicit Surfaces,” K. Lee and N. Patrikalakis, editors, 7th ACM Symposium on Solid Modeling and Applications, pp. 171–178.
10.
Garland, M., 1999, Quadric-Based Polygonal Surface Simplification, Ph.D. thesis, Carnegie Mellon University.
11.
Garland, M., and Heckbert, P. S., 1997, “Surface Simplification Using Quadric Error Metrics,” in Computer Graphics (Proceedings of SIGGRAPH ’97), pp. 209–216.
12.
Ohtake
,
Yu
, and
Belyaev
,
A. G.
,
2001
, “
Mesh Optimization for Polygonized Isosurfaces
,”
Computer Graphics Forum (Eurographics 2001 issue)
,
20
(
3
), pp.
368
376
.
13.
Wyvill
,
B.
, and
van Overveld
,
K.
,
1996
, “
Polygonization of Implicit Surfaces With Constructive Solid Geometry
,”
International Journal of Shape Modeling
,
2
(
4
), pp.
257
274
.
14.
Koenderink, J. J., 1990, Solid Shape, MIT Press.
15.
Zorin
,
D.
, and
Peter Schro¨der
,
P.
,
2001
, “
A Unified Framework for Primal/Dual Quadrilateral Subdivision Schemes
,”
Computer Aided Geometric Design
,
18
(
5
), pp.
429
454
.
16.
Taubin, G., 2001, “Dual Mesh Resampling,” in Proceedings of Pacific Graphics ’01, pp. 180–188.
17.
Ju
,
T.
,
Losasso
,
F.
,
Schaefer
,
S.
, and
Warren
,
J.
,
2002
, “
Dual Contouring of Hermite Data
,”
ACM Trans. Graphics
,
21
(
3
), pp.
339
346
.
18.
Taubin
,
G.
,
1991
, “
Estimation of Planar Curves, Surfaces and Non-Planar Space Curves Defined by Implicit Equations, With Applications to Edge and Range Image Segmentation
,”
IEEE Trans. Pattern Anal. Mach. Intell.
,
13
(
11
), pp.
115
1138
.
19.
Press, W. H., Teukolsky, S. A., Vetterling, W. T., and Flannery, B. P., 1993, Numerical Recipes in C: The Art of Scientific Computing, Cambridge University Press.
20.
Vorsatz, J., Ro¨ssl, C., Kobbelt, L. P., and Seidel, H.-P., 2001, “Feature Sensitive Remeshing,” Computer Graphics Forum (Eurographics 2001 issue), 20(3), pp. 393–401.
21.
Alliez, P., Meyer, M., and Desbrun, M., 2002, “Interactive Geometry Remeshing,” ACM Transactions on Graphics, 21(3), pp. 347–354.
22.
Kobbel, L., 2000, “3-Subdivision,” in Computer Graphics (Proceedings of SIGGRAPH 2000), pp. 103–112.
23.
Adzhiev, V., Cartwright, R., Fausett, E., Ossipov, A., Pasko, A., and Savchenko, V., 1999, “HyperFun Project: A Framework for Collaborative Multidimensional F-rep Modeling,” J. Hughes and C. Schlick, editors, Implicit Surfaces ’99, Eurographics/ACM SIGGRAPH Workshop, pp. 59–69.
24.
Kobbelt, L., Bareuther, T., and Seidel, H.-P., 2000, “Multi-Resolution Shape Deformations for Meshes With Dynamic Vertex Connectivity,” Computer Graphics Forum (Eurographics 2000 issue), 19(3), pp. C249–C260.
You do not currently have access to this content.