Boundary recovery for three dimensional conforming Delaunay triangulation
DOI10.1016/J.CMA.2003.12.058zbMATH Open1063.65135OpenAlexW2134505545MaRDI QIDQ704459FDOQ704459
Authors: Qiang Du, Desheng Wang 
Publication date: 13 January 2005
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cma.2003.12.058
Recommendations
- Constrained boundary recovery for three dimensional Delaunay triangulations
- Redesign of a conformal boundary recovery algorithm for 3D Delaunay triangulation
- Boundary recovery after 3D Delaunay tetrahedralization without adding extra nodes
- 3D boundary recovery by constrained Delaunay tetrahedralization
- The boundary recovery and sliver elimination algorithms of three‐dimensional constrained Delaunay triangulation
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Cites Work
- Delaunay refinement algorithms for triangular mesh generation
- Automatic three‐dimensional mesh generation by the finite octree technique
- Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
- Automatic mesh generator with specified boundary
- Generation of three‐dimensional unstructured grids by the advancing‐front method
- Parametric surface meshing using a combined advancing-front generalized Delaunay approach
- OPTIMAL DELAUNAY POINT INSERTION
- ASPECTS OF 2-D DELAUNAY MESH GENERATION
- Fast Delaunay triangulation in three dimensions
- Triangulation of arbitrary polyhedra to support automatic mesh generators
- 3D Delaunay mesh generation coupled with an advancing-front approach
- The integrity of geometrical boundaries in the two-dimensional delaunay triangulation
- Aspects of three‐dimensional constrained Delaunay meshing
- Title not available (Why is that?)
- Automatic mesh generation over intersecting surfaces
Cited In (17)
- Three-dimensional superconvergent gradient recovery on tetrahedral meshes
- Improved boundary constrained tetrahedral mesh generation by shell transformation
- Three dimensional boundary conforming Delaunay mesh generation
- Construction of the Dealauney tetrahedralization for bodies with curvilinear boundaries
- The boundary recovery and sliver elimination algorithms of three‐dimensional constrained Delaunay triangulation
- The optimal centroidal Voronoi tessellations and the Gersho's conjecture in the three-dimensional space
- Variational surface reconstruction based on Delaunay triangulation and graph cut
- Extraction of boundary representation from surface triangulations
- 3D boundary recovery by constrained Delaunay tetrahedralization
- Recent progress in robust and quality Delaunay mesh generation
- Boundary-conforming tetrahedral mesh generation for arbitrary polyhedra
- Recovery of an arbitrary edge on an existing surface mesh using local mesh modifications
- Constrained boundary recovery for three dimensional Delaunay triangulations
- Boundary recovery after 3D Delaunay tetrahedralization without adding extra nodes
- Adaptive anisotropic meshing for steady convection-dominated problems
- Redesign of a conformal boundary recovery algorithm for 3D Delaunay triangulation
- Adaptive variational curve smoothing based on level set method
This page was built for publication: Boundary recovery for three dimensional conforming Delaunay triangulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704459)
