Order-2 Delaunay triangulations optimize angles
From MaRDI portal
Publication:6663138
DOI10.1016/J.AIM.2024.110055MaRDI QIDQ6663138
Alexey I. Garber, Morteza Saghafian, Herbert Edelsbrunner
Publication date: 14 January 2025
Published in: Advances in Mathematics (Search for Journal in Brave)
Combinatorics in computer science (68R05) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)
Cites Work
- Title not available (Why is that?)
- Minimal roughness property of the Delaunay triangulation
- Triangulations. Structures for algorithms and applications
- Constrained Delaunay triangulations
- The farthest point Delaunay triangulation minimizes angles
- Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
- Flipping edges in triangulations
- Hypersimplicial subdivisions
- Plabic graphs and zonotopal tilings
- On Optimal Interpolation Triangle Incidences
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- Multiple packing and covering of the plane with circles
- Lectures on Polytopes
- A new duality result concerning Voronoi diagrams
- Sur la sphère vide.
This page was built for publication: Order-2 Delaunay triangulations optimize angles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663138)
