Abstract
Given a set of points in the plane, a crossing family is a collection of line segments, each joining two of the points, such that any two line segments intersect internally. Two setsA andB of points in the plane are mutually avoiding if no line subtended by a pair of points inA intersects the convex hull ofB, and vice versa. We show that any set ofn points in general position contains a pair of mutually avoiding subsets each of size at least\(\sqrt {n/12} \). As a consequence we show that such a set possesses a crossing family of size at least\(\sqrt {n/12} \), and describe a fast algorithm for finding such a family.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Alon andP. Erdős: Disjoint edges in geometric graphs,Discrete Comput. Geom. 4 (1989), 287–290.
V. Capoyleas andJ. Pach: A Turán-type theorem on chords of a convex polygon,J. Combin. Theory. Ser. B 56 (1992), 9–15.
H. Edelsbrunner:Algorithms in Combinatorial Geometry, Springer-Verlag, Berlin, 1987.
P. Erdős andG. Szekeres: A combinatorial problem in geometry,Compositio Math. 2 (1935), 463–470.
J. Matoušek: Efficient partition tress,Discrete Comput. Geom. 8 (1992), 315–334.
J. Pach andJ. Törőcsik: Some geometric applications of Dilworth's theorem,Proc. 9th ACM Symp. Comput. Geom. (1993), 264–269. Also:Discrete Comput. Geom., to appear.
P. Valtr: On mutually avoiding sets, manuscript.
Author information
Authors and Affiliations
Additional information
Research supported in part by DARPA grant N00014-89-J-1988, Air Force AFOSR-89-0271, NSF grant DMS-8606225, and an ONR graduate fellowship. Further, part of this work was conducted at and supported by DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center-NSF-STC8809648.