There are simple and robust refinements (almost) as good as Delaunay
From MaRDI portal
Publication:2229908
Recommendations
- WHEN AND WHY DELAUNAY REFINEMENT ALGORITHMS WORK
- Nice point sets can have nasty Delaunay triangulations
- Nice point sets can have nasty Delaunay triangulations
- Delaunay meshing of piecewise smooth complexes without expensive predicates
- Delaunay refinement for piecewise smooth complexes
- Delaunay refinement for piecewise smooth complexes
- scientific article; zbMATH DE number 2119653
- Dense point sets have sparse Delaunay triangulations or ``\dots but not too nasty
Cites work
- scientific article; zbMATH DE number 53528 (Why is no real title available?)
- scientific article; zbMATH DE number 1033560 (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
- A Robust Implementation for Three-Dimensional Delaunay Triangulations
- A geometric diagram and hybrid scheme for triangle subdivision
- Combining improvement and refinement techniques: 2D Delaunay mesh adaptation under domain changes
- Delaunay refinement algorithms for triangular mesh generation
- Improving the quality of meshes for the simulation of semiconductor devices using Lepp‐based algorithms
- Provably good mesh generation
- Refinement based on longest-edge and self-similar four-triangle partitions
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- The 4-triangles longest-side partition of triangles and linear refinement algorithms
This page was built for publication: There are simple and robust refinements (almost) as good as Delaunay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229908)
