Katajainen and M. Koppinen ( Delaunay Triangulation): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n log log n)$ == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM? == Year == 1987 == Reference == https://www.semanticscholar.org/paper/Constructing-Delaunay-triangulations-by-merging-in-Katajainen-Koppinen/b13059c096f37407ea680fec0e61e000f6407292") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n | $O(n \log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
| Line 11: | Line 11: | ||
== Description == | == Description == | ||
Cell technique and divide-and-conquer | |||
== Approximate? == | == Approximate? == | ||
| Line 27: | Line 27: | ||
== Year == | == Year == | ||
1988 | |||
== Reference == | == Reference == | ||
https:// | https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6313167 | ||
Latest revision as of 08:44, 10 April 2023
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