Delaunay Triangulation
Given a set of points, the Delaunay Triangulation problem is to triangulate the points using the following notion of triangulation. is an edge of the Delaunay triangulation iff there is a circle passing through and so that all other points in the point set, , where is not equal to or , lie outside the circle. Equivalently, all triangles in the Delaunay triangulation for a set of points will have empty circumscribed circles. That is, no points lie in the interior of any triangle's circumcircle.
Parameters
- : number of points
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Displaying 1 of 1 algorithms
| See more | ||||
|---|---|---|---|---|
| Fortune | 1987 |
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Insuffient Data to display table