Greedy is as Good as Delaunay (Almost)

Abstract

Let S be a planar point set. Krznaric and Levcopoulos proved that given the Delaunay triangulation DT(S) for S, one can find the greedy triangulation GT(S) in linear time. We provide a (partial) converse of this result: given GT(S), it is possible to compute DT(S) in linear expected time. Thus, these structures are basically equivalent. To obtain our result… (More)

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.