Tuned terminal triangles centroid Delaunay algorithm for quality triangulation
From MaRDI portal
Recommendations
- Quality Triangulations with Locally Optimal Steiner Points
- scientific article; zbMATH DE number 437532
- Delaunay refinement algorithms for triangular mesh generation
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
- Fully Generalized Two-Dimensional Constrained Delaunay Mesh Refinement
Cites work
- scientific article; zbMATH DE number 1143749 (Why is no real title available?)
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
- A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
- Complexity of the bisection method
- Delaunay mesh generation.
- Delaunay refinement algorithms for triangular mesh generation
- Geometrical Mesh Improvement Properties of Delaunay Terminal Edge Refinement
- Laplacian smoothing and Delaunay triangulations
- New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations
- On Faster Convergence of the Bisection Method for Certain Triangles
- Quality Triangulations with Locally Optimal Steiner Points
- Terminal star operations algorithm for tetrahedral mesh improvement
Cited in
(4)
This page was built for publication: Tuned terminal triangles centroid Delaunay algorithm for quality triangulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296621)