Polygonization of implicit surfaces
Computer Aided Geometric Design
Generative modeling for computer graphics and CAD: symbolic shape design using interval analysis
Generative modeling for computer graphics and CAD: symbolic shape design using interval analysis
Guaranteed-quality mesh generation for curved surfaces
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Using particles to sample and control implicit surfaces
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Guaranteeing the topology of an implicit surface polygonization for interactive modeling
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Tetrahedral mesh generation by Delaunay refinement
Proceedings of the fourteenth annual symposium on Computational geometry
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
Conforming Delaunay triangulations in 3D
Proceedings of the eighteenth annual symposium on Computational geometry
Provably good surface sampling and approximation
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Quality Meshing with Weighted Delaunay Refinement
SIAM Journal on Computing
Isotopic implicit surface meshing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Natural neighbor coordinates of points on a surface
Computational Geometry: Theory and Applications
Isotopic approximation of implicit curves and surfaces
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
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
Learning smooth shapes by probing
Computational Geometry: Theory and Applications
A generic software design for Delaunay refinement meshing
Computational Geometry: Theory and Applications
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Delaunay refinement for piecewise smooth complexes
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Topology, Accuracy, and Quality of Isosurface Meshes Using Dynamic Particles
IEEE Transactions on Visualization and Computer Graphics
Maintaining deforming surface meshes
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Direct sampling on surfaces for high quality remeshing
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Delpsc: a delaunay mesher for piecewise smooth complexes
Proceedings of the twenty-fourth annual symposium on Computational geometry
Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Proceedings of the twenty-fifth annual symposium on Computational geometry
Direct sampling on surfaces for high quality remeshing
Computer Aided Geometric Design
Technical Section: Variational implicit surface meshing
Computers and Graphics
Ambient Isotopic Meshing for Implicit Algebraic Surfaces with Singularities
CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
Surface sampling and the intrinsic Voronoi diagram
SGP '08 Proceedings of the Symposium on Geometry Processing
SMI 2011: Full Paper: Template-based quadrilateral meshing
Computers and Graphics
Complete subdivision algorithms, II: Isotopic meshing of singular algebraic curves
Journal of Symbolic Computation
3D shape from unorganized 3d point clouds
ISVC'05 Proceedings of the First international conference on Advances in Visual Computing
Quality tetrahedral mesh generation for macromolecules
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Non-local isotopic approximation of nonsingular surfaces
Computer-Aided Design
| Hi-index | 0.00 |
This paper presents an algorithm for sampling and triangulatinga smooth surface Σ ⊂ ℝ3 where the triangulation is homeomorphic to Σ. The only assumption we make is that the input surface representation is amenable to certain types of computations, namely computations of the intersection points of a line with the surface, computations of the critical points of some height functions defined on the surface and its restriction to a plane, and computations of some silhouette points. The algorithm ensures bounded aspect ratio, size optimality, and smoothness of the output triangulation. Unlike previous algorithms, this algorithm does not need to compute the local feature size for generating the sample points which was a major bottleneck. Experiments show the usefulness of the algorithm in remeshing and meshing CAD surfaces that are piecewise smooth.