Approximating uniform triangular meshes in polygons
From MaRDI portal
Recommendations
- Approximating uniform triangular meshes in polygons.
- Approximating uniform triangular meshes for spheres
- Triangulating a convex polygon with small number of non-standard bars. Extended abstract
- Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths
- OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS
Cited in
(9)- Approximating uniform triangular meshes in polygons.
- Triangulating a convex polygon with fewer number of non-standard bars
- MAC Schemes on Triangular Meshes
- scientific article; zbMATH DE number 1548041 (Why is no real title available?)
- Approximating uniform triangular meshes for spheres
- Optimal Triangulation with Steiner Points
- Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths
- Triangulating a convex polygon with small number of non-standard bars. Extended abstract
- An inequality on the edge lengths of triangular meshes
This page was built for publication: Approximating uniform triangular meshes in polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2766811)