5
votes
How can one prove the duality of Voronoi and Delaunay?
The duality between Voronoi cells and vertices of the triangulation is pretty clear: each vertex of the Delaunay triangulation is a site in the Voronoi diagram which gets associated with its Voronoi ...
3
votes
Accepted
Computing a power diagram
From wikipedia:
in the power diagram, we may view each circle center as a site, and
each circle's squared radius as a weight that is subtracted from the
squared Euclidean distance before comparing it ...
2
votes
Polynomial reconstruction on unstructured grids
You could use a Least Square fit approach to fit some polynomial via neighboring nodes.
You could even make the Least Square fit weighted based on distances (potentially passed through something ...
1
vote
Elliptic PDE finite volume method with Dirichlet boundary condition
In a cell centered finite volume setting your are discretising the fluxes over your cell boundary as you indicated. Lets say we look at one face between the cubes A and B, the calculated flux would be:...
1
vote
Polynomial reconstruction on unstructured grids
It is not polynomial, but you may be interested in the Natural Neighbors interpolation (it fits well with Voronoi diagram). To evaluate the interpolant at a given point, insert the point into the ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
voronoi-diagrams × 13computational-geometry × 9
delaunay-triangulation × 4
algorithms × 2
finite-volume × 2
geometry × 2
pde × 1
python × 1
convex-optimization × 1
interpolation × 1
fortran × 1
discretization × 1
complexity × 1
elliptic-pde × 1
software-recommendation × 1
convex-hull × 1
matplotlib × 1
closest-point × 1