Linde–Buzo–Gray algorithm ( Voronoi Diagrams)

From Algorithm Wiki

Revision as of 09:42, 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

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1980

Reference

https://ieeexplore.ieee.org/document/1094577/

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Linde–Buzo–Gray_algorithm_(_Voronoi_Diagrams)&oldid=47397"