Non-simplicial Delaunay meshing via approximation by radical partitions
Vladimir Garanzha, Liudmila Kudryavtseva, Lennard Kamenski

TL;DR
This paper proposes a novel approach to constructing non-simplicial Delaunay meshes through approximation by radical partitions, using convex polyhedra limits and a discrete Dirichlet functional, with experimental validation.
Contribution
It introduces a new method for non-simplicial Delaunay meshing based on radical partitions and convex polyhedra limits, including a functional for mesh optimization.
Findings
The approach is experimentally viable for constructing Delaunay meshes.
The discrete Dirichlet functional guides the evolution of Delaunay spheres.
Mesh optimization can be achieved using the proposed manifold constraint.
Abstract
We consider the construction of a polyhedral Delaunay partition as a limit of the sequence of power diagrams (radical partitions). The dual Voronoi diagram is obtained as a limit of the sequence of weighted Delaunay partitions. The problem is reduced to the construction of two dual convex polyhedra, inscribed and superscribed around a circular paraboloid, as a limit of the sequence of pairs of general dual convex polyhedra. The sequence of primal polyhedra should converge to the superscribed polyhedron and the sequence of the dual polyhedra converges to the inscribed polyhedron. We are interested in the case when the vertices of primal polyhedra can move or merge together, i.e., no new faces are allowed for dual polyhedra. These rules define the transformation of the set of initial spheres into the set of Delaunay spheres using radius variation and sphere movement and elimination.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
