Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
131 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Greedy is as Good as Delaunay (Almost) (1302.5635v2)

Published 22 Feb 2013 in cs.CG

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, we generalize another algorithm by Krznaric and Levcopoulos to find a hierarchical clustering for S in linear time, once DT(S) is known. We show that their algorithm remains (almost) correct for any triangulation of bounded dilation, i.e., any triangulation in which the shortest path distance between any two points approximates their Euclidean distance. In general, however, the resulting running time may be superlinear. Nonetheless, we can show that the properties of the greedy triangulation suffice to guarantee a linear time bound.

Summary

We haven't generated a summary for this paper yet.