Three-dimensional triangulations from local transformations
SIAM Journal on Scientific and Statistical Computing
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Construction of three-dimensional improved-quality triangulations using local transformations
SIAM Journal on Scientific Computing
Tetrahedral mesh generation by Delaunay refinement
Proceedings of the fourteenth annual symposium on Computational geometry
A point-placement strategy for conforming Delaunay tetrahedralization
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software (TOMS)
Delaunay Triangulation Using a Uniform Grid
IEEE Computer Graphics and Applications
Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Construction Of the Constrained Delaunay Triangulation Of A Polygonal Domain
CAD Systems Development: Tools and Methods [Dagstuhl Seminar, 1995]
Constrained delaunay triangulation using delaunay visibility
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part I
Efficient computation of clipped Voronoi diagram for mesh generation
Computer-Aided Design
| Hi-index | 0.00 |
An unstructured tetrahedral mesh generation algorithm for 3D model with constraints is presented. To automatically generate a tetrahedral mesh for model with constraints, an advancing front algorithm is presented based on conforming constrained Delaunay tetrahedralization (CCDT). To reduce the number of visibility tests between vertices with respect to model faces as well as the computation of constrained Delaunay tetrahedra, a sufficient condition for DT (constrained Delaunay tetrahedralization whose simplexes are all Delaunay) existence is presented and utilized coupled to uniform grid and advancing front techniques in our algorithm. The mesh generator is robust and exhibits a linear time complexity for mechanical models with uniform density distribution.