4 citations · 7 across the 5 of their papers we have counts for
Showing math.NAShow all
2 papers · 1 filter
math.NA2022★ 4 cited
Non-simplicial Delaunay meshing via approximation by radical partitions
Vladimir Garanzha, Liudmila Kudryavtseva, Lennard Kamenski
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 o…
math.NA2018★ 1 cited
Construction of near-boundary Voronoi mesh layers for planar domains
V. A. Garanzha, L. N. Kudryavtseva, V. O. Tsvetkova
We consider problem of constructing purely Voronoi mesh where the union of uncut Voronoi cells approximates the planar computational domain with piecewise-smooth boundary. Smooth b…