scholarly journals Isotopic Implicit Surface Meshing

2008 ◽  
pp. 1-20
Author(s):  
Jean-Daniel Boissonnat ◽  
David Cohen-Steiner ◽  
Gert Vegter
2007 ◽  
Vol 39 (1-3) ◽  
pp. 138-157 ◽  
Author(s):  
Jean-Daniel Boissonnat ◽  
David Cohen-Steiner ◽  
Gert Vegter

2009 ◽  
Vol 33 (3) ◽  
pp. 312-320 ◽  
Author(s):  
Arnaud Gelas ◽  
Sébastien Valette ◽  
Rémy Prost ◽  
Wieslaw L. Nowinski

2002 ◽  
Vol 2 (4) ◽  
pp. 277-284 ◽  
Author(s):  
Yutaka Ohtake ◽  
Alexander G. Belyaev

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.


2011 ◽  
Vol 346 ◽  
pp. 259-265
Author(s):  
Xiao Ming Liu ◽  
Lei Yang ◽  
Qiang Hu ◽  
Jun Hai Yong

Point projection on an implicit surface is essential for the geometric modeling and graphics applications of it. This paper presents a method for computing the principle curvatures and principle directions of an implicit surface. Using the principle curvatures and principle directions, we construct a torus patch to approximate the implicit surface locally. The torus patch is second order osculating to the implicit surface. By taking advantage of the approximation torus patch, this paper develops a second order geometric iterative algorithm for point projection on the implicit surface. Experiments illustrate the efficiency and less dependency on initial values of our algorithm.


2004 ◽  
Vol 23 (3) ◽  
pp. 609-612 ◽  
Author(s):  
Yutaka Ohtake ◽  
Alexander Belyaev ◽  
Hans-Peter Seidel

Author(s):  
Michael Oechsle ◽  
Michael Niemeyer ◽  
Christian Reiser ◽  
Lars Mescheder ◽  
Thilo Strauss ◽  
...  

2007 ◽  
Vol 13 (4) ◽  
pp. 7-16
Author(s):  
B. Mederos ◽  
M. Lage ◽  
S. Arouca ◽  
F. Petronetto ◽  
L. Velho ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document