Non-simplicial Delaunay meshing via approximation by radical partitions
From MaRDI portal
Publication:2172340
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. Existence theorems are still unavailable but we suggest a functional measuring the deviation of the convex polyhedron from the one inscribed into the paraboloid. It is the discrete Dirichlet functional for the power function which is a linear interpolant of the vertical distance of the dual vertices from the paraboloid. The functional's absolute minimizer is attained on the constant power field, meaning that the inscribed polyhedron can be obtained by a simple translation. This formulation of the functional for the dual surface is not quadratic since the unknowns are the vertices of the primal polyhedron, hence, the transformation of the set of spheres into Delaunay spheres is not unique. We concentrate on the experimental confirmation of the approach viability and put aside mesh quality problems. The zero value of the gradient of the proposed functional defines a manifold describing the evolution of Delaunay spheres. Hence, Delaunay-Voronoi meshes can be optimized using the manifold as a constraint.
Recommendations
- Simultaneous mesh generation and partitioning for Delaunay meshes
- Delaunay meshing of piecewise smooth complexes without expensive predicates
- Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems
- Generalized Delaunay triangulations of non-convex domains
- scientific article; zbMATH DE number 5239226
- The Delaunay triangulation for multidimensional surfaces and its approximative properties
- Delaunay refinement for piecewise smooth complexes
- Delaunay refinement for piecewise smooth complexes
- On the Provably Tight Approximation of Optimal Meshing for Non-convex Regions
Cites work
- Geometry and Topology for Mesh Generation
- scientific article; zbMATH DE number 3063640 (Why is no real title available?)
- Hybrid Voronoi mesh generation: algorithms and unsolved problems
- Minimal roughness property of the Delaunay triangulation
- Numerical geometry, grid generation and scientific computing. Proceedings of the 9th international conference, NUMGRID 2018 / Voronoi 150, celebrating the 150th anniversary of G.F. Voronoi, Moscow, Russia, December 3--5, 2018
- On Conjugate Convex Functions
- TetGen, a Delaunay-based quality tetrahedral mesh generator
- Voronoi diagrams and arrangements
- Voronoi diagrams and Delaunay triangulations
- Why do we need Voronoi cells and Delaunay meshes?
- Why do we need Voronoi cells and Delaunay meshes? Essential properties of the Voronoi finite volume method
Cited in
(4)
This page was built for publication: Non-simplicial Delaunay meshing via approximation by radical partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2172340)
