Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Generating textures on arbitrary surfaces using reaction-diffusion
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Guaranteed-quality mesh generation for curved surfaces
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Using particles to sample and control implicit surfaces
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
A Delaunay refinement algorithm for quality 2-dimensional mesh generation
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Guaranteeing the topology of an implicit surface polygonization for interactive modeling
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Surface reconstruction by Voronoi filtering
Proceedings of the fourteenth annual symposium on Computational geometry
Multiresolution signal processing for meshes
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Surface approximation and geometric partitions
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Nice point sets can have nasty Delaunay triangulations
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Hierarchical extraction of iso-surfaces with semi-regular meshes
Proceedings of the seventh ACM symposium on Solid modeling and applications
Complexity of the delaunay triangulation of points on surfaces the smooth case
Proceedings of the nineteenth annual symposium on Computational geometry
Delaunay refinement algorithms for triangular mesh generation
Computational Geometry: Theory and Applications
Natural neighbor coordinates of points on a surface
Computational Geometry: Theory and Applications
Sampling and meshing a surface with guaranteed topology and geometry
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Interpolating and approximating implicit surfaces from polygon soup
ACM SIGGRAPH 2004 Papers
Variational shape approximation
ACM SIGGRAPH 2004 Papers
Provably good moving least squares
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
AFRIGRAPH '06 Proceedings of the 4th international conference on Computer graphics, virtual reality, visualisation and interaction in Africa
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Provably good sampling and meshing of surfaces
Graphical Models - Solid modeling theory and applications
A semi-Lagrangian contouring method for fluid simulation
ACM Transactions on Graphics (TOG)
Graphical Models - Special issue on SMI 2004
Partial and approximate symmetry detection for 3D geometry
ACM SIGGRAPH 2006 Papers
Interpolating and approximating implicit surfaces from polygon soup
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
Provably good moving least squares
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
An effective condition for sampling surfaces with guarantees
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Triangulating point set surfaces with bounded error
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Provably good moving least squares
ACM Transactions on Algorithms (TALG)
Direct sampling on surfaces for high quality remeshing
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Frequency-based representation of 3D point-based surfaces using spherical harmonics
Machine Graphics & Vision International Journal
Approximating the pathway axis and the persistence diagram of a collection of balls in 3-space
Proceedings of the twenty-fourth annual symposium on Computational geometry
Quality mesh generation for molecular skin surfaces using restricted union of balls
Computational Geometry: Theory and Applications
Direct sampling on surfaces for high quality remeshing
Computer Aided Geometric Design
Adaptive surface meshes coarsening with guaranteed quality and topology
Proceedings of the 2009 Computer Graphics International Conference
The HybridTree: a hybrid constructive shape representation for free-form modeling
Heterogeneous objects modelling and applications
BronWall: a software system for volumetric quantification of the bronchial wall remodeling in MDCT
ICCOM'06 Proceedings of the 10th WSEAS international conference on Communications
Convex hull and voronoi diagram of additively weighted points
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Assessment of airway remodeling in asthma: volumetric versus surface quantification approaches
MICCAI'06 Proceedings of the 9th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part II
Quality tetrahedral mesh generation for macromolecules
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Shape reconstruction from unorganized set of points
ICIAR'10 Proceedings of the 7th international conference on Image Analysis and Recognition - Volume Part I
| Hi-index | 0.00 |
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy "farthest point" technique proposed by Chew. Given a surface S, it progressively adds points on S and updates the 3-dimensional Delaunay triangulation of the points. The method is very simple and works in 3d-space without requiring to parameterize the surface. Taking advantage of recent results on the restricted Delaunay triangulation, we prove that the algorithm can generate good samples on S as well as triangulated surfaces that approximate S. More precisely, we show that the restricted Delaunay triangulation Del\S of the points has the same topology type as S, that the Hausdorff distance between Del\S and S can be made arbitrarily small, and that we can bound the aspect ratio of the facets of Del\S. The algorithm has been implemented and we report on experimental results that provide evidence that it is very effective in practice. We present results on implicit surfaces, on CSG models and on polyhedra. Although most of our theoretical results are given for smooth closed surfaces, the method is quite robust in handling smooth surfaces with boundaries, and even non-smooth surfaces.