Pages that link to "Item:Q5698770"
From MaRDI portal
The following pages link to Constrained boundary recovery for three dimensional Delaunay triangulations (Q5698770):
Displaying 12 items.
- Efficient mesh optimization schemes based on optimal Delaunay triangulations (Q646311) (← links)
- Dealing with extremely large deformation by Nearest-Nodes FEM with algorithm for updating element connectivity (Q837508) (← links)
- Improved boundary constrained tetrahedral mesh generation by shell transformation (Q2294804) (← links)
- The optimal centroidal Voronoi tessellations and the Gersho's conjecture in the three-dimensional space (Q2387368) (← links)
- Recent progress in robust and quality Delaunay mesh generation (Q2497533) (← links)
- Redesign of a conformal boundary recovery algorithm for 3D Delaunay triangulation (Q2644502) (← links)
- Variational surface reconstruction based on Delaunay triangulation and graph cut (Q3017982) (← links)
- Aspects of three‐dimensional constrained Delaunay meshing (Q4305066) (← links)
- TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator (Q5270714) (← links)
- The boundary recovery and sliver elimination algorithms of three‐dimensional constrained Delaunay triangulation (Q5435332) (← links)
- Three-dimensional superconvergent gradient recovery on tetrahedral meshes (Q6560651) (← links)
- Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time (Q6569247) (← links)