For any n points in the plane: (a) There are n^0.66 distinct distances (b) There are n^0.8 distinct distances

For any n points in the plane: (a) There are n^0.66 distinct distances (b) There are n^0.8 distinct distances

Cached

Download Links

[www.cs.umd.edu]

by William Gasarch

BibTeX

@MISC{Gasarch_forany,
    author = {William Gasarch},
    title = {For any n points in the plane: (a) There are n^0.66 distinct distances (b) There are n^0.8 distinct distances},
    year = {}
}

Bookmark

OpenURL

Abstract

Citations

147	Combinatorial Geometry - Pach, Agarwal - 1995
136	Combinatorial complexity bounds for arrangements of curves and spheres, Discrete and Computational Geometry 5 - Clarkson, Edelsbrunner, et al. - 1990
99	On sets of distances of n points - Erdős - 1970
92	Crossing numbers and hard Erdös problems in discrete geometry - Székely - 1997
88	Complexity Issues in VLSI - Leighton - 1983
34	Extremal problems in discrete geometry - Szemerédi, Trotter - 1983
24	On the dierent distances determined by n points - Moser - 1952
23	A new entropy inequality for the Erdös distance problem Contemp. Math. 342, Towards a theory of geometric graphs - Katz, Tardos - 2004
20	Improving the crossing lemma by finding more crossings in sparse graphs, Discrete Comput - Pach, Radoičić, et al.
17	The number of different distances determined by n points in the plane - Chung - 1984
16	The number of different distances determined by a set of points in the Euclidean plane, Discrete - Chung, Szemerédi, et al. - 1992
12	Distinct distances in the plane - Solymosi, Tóth
5	Graphs drawn with few crossings - Pach, Toth - 1997
4	Crossing free subgraphs - Ajtai, Chvátal, et al. - 1982
3	On distinct distances and distinct distances - Tardos - 2003