Dense Point Sets with Many Halving Lines
Keyword(s):
Abstract A planar point set of n points is called $$\gamma $$ γ -dense if the ratio of the largest and smallest distances among the points is at most $$\gamma \sqrt{n}$$ γ n . We construct a dense set of n points in the plane with $$ne^{\Omega ({\sqrt{\log n}})}$$ n e Ω ( log n ) halving lines. This improves the bound $$\Omega (n\log n)$$ Ω ( n log n ) of Edelsbrunner et al. (Discrete Comput Geom 17(3):243–255, 1997). Our construction can be generalized to higher dimensions, for any d we construct a dense point set of n points in $$\mathbb {R}^d$$ R d with $$n^{d-1}e^{\Omega ({\sqrt{\log n}})}$$ n d - 1 e Ω ( log n ) halving hyperplanes. Our lower bounds are asymptotically the same as the best known lower bounds for general point sets.
1952 ◽
Vol 4
◽
pp. 424-435
◽
Keyword(s):
2003 ◽
Vol 40
(3)
◽
pp. 269-286
◽
Keyword(s):
Keyword(s):
Keyword(s):
2019 ◽
Vol 29
(04)
◽
pp. 301-306
Keyword(s):
2012 ◽
Vol 22
(03)
◽
pp. 207-214
Keyword(s):