Planar point sets determine many pairwise crossing segments
نویسندگان
چکیده
We show that any set of n points in general position the plane determines 1 ? o ( ) pairwise crossing segments. The best previously known lower bound, ? , was proved more than 25 years ago by Aronov, Erd?s, Goddard, Kleitman, Klugerman, Pach, and Schulman. Our proof is fully constructive, extends to dense geometric graphs.
منابع مشابه
Point sets with many non-crossing perfect matchings
The maximum number of non-crossing straight-line perfect matchings that a set of n points in the plane can have is known to be O(10.0438) and Ω∗(3n). The lower bound, due to Garćıa, Noy, and Tejel (2000), is attained by the double chain, which has Θ(3/n) such matchings. We reprove this bound in a simplified way that uses the novel notion of down-free matchings. We then apply this approach to se...
متن کاملDense point sets with many halving lines
We construct a dense point set of n points in the plane with ne( √ logn) halving lines. This improves the bound O(n log n) of Edelsbrunner, Valtr and Welzl from 1997. We also observe that the upper bound on the maximum number of halving lines of dense point set can be improved to O(n). Our construction can be generalized to higher dimensions, for any d we construct a dense point set of n points...
متن کاملPartitions of planar point sets into polygons
In this paper, we characterize planar point sets that can be partitioned into disjoint polygons of arbitrarily specified sizes. We provide an algorithm to construct such a partition, if it exists, in polynomial time. We show that this problem is equivalent to finding a specified 2-factor in the visibility graph of the point set. The characterization for the case where all cycles have length 3 a...
متن کاملOn Point-Sets That Support Planar Graphs
Article history: Received 14 October 2011 Accepted 27 March 2012 Available online xxxx Communicated by D. Wagner
متن کاملVietoris-Rips Complexes of Planar Point Sets
Fix a finite set of points in Euclidean n-space En, thought of as a point-cloud sampling of a certain domain D ⊂ En. The VietorisRips complex is a combinatorial simplicial complex based on proximity of neighbors that serves as an easily-computed but high-dimensional approximation to the homotopy type of D. There is a natural “shadow” projection map from the Vietoris-Rips complex to En that has ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2021
ISSN: ['1857-8365', '1857-8438']
DOI: https://doi.org/10.1016/j.aim.2021.107779