Angle-bounded 2D mesh simplification
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 734930 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
- A data reduction scheme for triangulated surfaces
- Condition of finite element matrices generated from nonuniform meshes.
- DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
- Delaunay refinement algorithms for triangular mesh generation
- Interleaving Delaunay refinement and optimization for 2D triangle mesh generation
- LATIN 2004: Theoretical Informatics
- On the finite element method
- OpenFlipper: an open source geometry processing and rendering framework
- Provably good mesh generation
- Quality Triangulations with Locally Optimal Steiner Points
- Quasi-Concave Programming
Cited in
(2)
This page was built for publication: Angle-bounded 2D mesh simplification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139713)