Non-simplicial Delaunay meshing via approximation by radical partitions

DOI10.1134/S096554252208005XzbMath1497.52022arXiv2201.05135WikidataQ114075106 ScholiaQ114075106MaRDI QIDQ2172340

L. N. Kudryavtseva, V. A. Garanzha, L. Kamenski

Publication date: 15 September 2022

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.05135

zbMATH Keywords

power diagramDelaunay triangulationweighted Delaunay triangulationDelaunay-Voronoi meshesDelaunay partitionVoronoi triangulationpolygonal Delaunay meshingradical partition

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Polyhedral manifolds (52B70)

Uses Software

• TetGen

Cites Work

• Unnamed Item
• Minimal roughness property of the Delaunay triangulation
• Voronoi diagrams and arrangements
• Why do we need Voronoi cells and Delaunay meshes? Essential properties of the Voronoi finite volume method
• Hybrid Voronoi mesh generation: algorithms and unsolved problems
• Voronoi Diagrams and Delaunay Triangulations
• Why Do We Need Voronoi Cells and Delaunay Meshes?
• Geometry and Topology for Mesh Generation
• Numerical Geometry, Grid Generation and Scientific Computing
• TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator
• On Conjugate Convex Functions

This page was built for publication: Non-simplicial Delaunay meshing via approximation by radical partitions