On the sizes of Delaunay meshes
From MaRDI portal
Publication:2489538
DOI10.1016/j.comgeo.2005.08.002zbMath1137.52305OpenAlexW2048591084MaRDI QIDQ2489538
Publication date: 28 April 2006
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: http://repository.ust.hk/ir/bitstream/1783.1-2600/1/delsize.pdf
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (1)
Cites Work
- Geometry and Topology for Mesh Generation
- Sliver exudation
- On the Radius-Edge Condition in the Control Volume Method
- Quality Meshing with Weighted Delaunay Refinement
- WHEN AND WHY DELAUNAY REFINEMENT ALGORITHMS WORK
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
- Quality Mesh Generation in Higher Dimensions
- Quality meshing for polyhedra with small angles
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the sizes of Delaunay meshes