Katajainen and M. Koppinen ( 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 n)$

Space Complexity

words

()

Description

Cell technique and divide-and-conquer

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM?

Year

1988

Reference

https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6313167

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Katajainen_and_M._Koppinen_(_Delaunay_Triangulation)&oldid=47441"