Hierarchical RLE level set: A compact and versatile deformable surface representation
ACM Transactions on Graphics (TOG)
Twinned meshes for dynamic triangulation of implicit surfaces
GI '07 Proceedings of Graphics Interface 2007
International Journal of Computational Science and Engineering
3D Model Segmentation and Representation with Implicit Polynomials
IEICE - Transactions on Information and Systems
Marching triangle polygonization for efficient surface reconstruction from its distance transform
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
A Convergent Finite Volume Scheme for Diffusion on Evolving Surfaces
SIAM Journal on Numerical Analysis
Efficient and prioritized point subsampling for CSRBF compression
SPBG'06 Proceedings of the 3rd Eurographics / IEEE VGTC conference on Point-Based Graphics
| Hi-index | 0.00 |
We present an algorithm for polygonizing closed implicit surfaces, which produces meshes adapted to the local curvature of the surface.Our method is similar to, but NOT based on, Marching Triangles, in that we start from a point on the surface and develop a mesh from that point using a surface-tracking approach.In a marked departure from previous approaches, our meshes approximate the surface through heuristics relying on curvature.Furthermore, our method works completely on-the-fly, resolving cracks as it proceeds, without the need for any post-remeshing step to correct failures.We have tested the algorithm with three different representations of implicit surfaces, Variational, analytical and MPU, using non-trivial data sets, yielding results that illustrate the flexibility and scalability of our technique.Performance comparisons with variants of Marching Cubes show that our approach is capable of good accuracy and meshing quality without sacrificing computing resources.