Dwyer (higher dimensions) (General Delaunay Triangulation (d-dimensions) Delaunay Triangulation)

From Algorithm Wiki

Revision as of 09:44, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n \log \log n)$

Space Complexity

$O(n)$? words

(Keep track of O(1) information per triangle related to triangulation??)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM?

Year

1987

Reference

https://link.springer.com/article/10.1007/BF02574694

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Dwyer_(higher_dimensions)_(General_Delaunay_Triangulation_(d-dimensions)_Delaunay_Triangulation)&oldid=47442"