Triangulation of arbitrary polyhedra to support automatic mesh generators
From MaRDI portal
Recommendations
- Simplicial mesh of an arbitrary polyhedron.
- ?Ultimate? robustness in meshing an arbitrary polyhedron
- Delaunay refinement algorithms for triangular mesh generation
- Automatic mesh generator using the Delaunay-Voronoï principle
- Robust boundary triangulation and delaunay triangulation of arbitrary planar domains
Cited in
(14)- Tetrahedron-based octree encoding for automatic mesh generation
- A new polyhedral element for the analysis of hexahedral-dominant finite element models and its application to nonlinear solid mechanics problems
- A new finite element approach for solving three-dimensional problems using trimmed hexahedral elements
- Simplicial mesh of an arbitrary polyhedron.
- scientific article; zbMATH DE number 2089248 (Why is no real title available?)
- scientific article; zbMATH DE number 1205927 (Why is no real title available?)
- scientific article; zbMATH DE number 1131777 (Why is no real title available?)
- Variational surface reconstruction based on Delaunay triangulation and graph cut
- Quality Mesh Generation in Higher Dimensions
- Recent progress in robust and quality Delaunay mesh generation
- ?Ultimate? robustness in meshing an arbitrary polyhedron
- Untangling of 2D meshes in ALE simulations
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
- Boundary recovery for three dimensional conforming Delaunay triangulation
This page was built for publication: Triangulation of arbitrary polyhedra to support automatic mesh generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508071)