|
Related articles:
Convex hull
Voronoi diagram
Simplex
Key terms: points set triangle flip edge log dt delaunay triangulation algorithm contains geometry split plane vertices fast centers circumcircle unique convex hull set of points graph set p dimensions vmatrix computational take o random vertex euclidean any other minimum simplex runtime produces discrete common edge technique simplices two triangles definition three points divide and conquer voronoi diagram general position meet the delaunay condition triangulation does triangle that contains points are on the same computational geometry triangulation of the points Search external links cited by footnotes on Wikipedia page Delaunay triangulation: |
|