Crossing families

B. Aronov, P. Erdős, W. Goddard, D. J. Kleitman, M. Klugerman, J. Pach, L. J. Schulman

Research output: Contribution to journalArticle

36 Citations (Scopus)

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 sets A and B of points in the plane are mutually avoiding if no line subtended by a pair of points in A intersects the convex hull of B, and vice versa. We show that any set of n points in general position contains a pair of mutually avoiding subsets each of size at least {Mathematical expression}. As a consequence we show that such a set possesses a crossing family of size at least {Mathematical expression}, and describe a fast algorithm for finding such a family.

Original languageEnglish
Pages (from-to)127-134
Number of pages8
JournalCombinatorica
Volume14
Issue number2
DOIs
Publication statusPublished - Jun 1994

Fingerprint

Joining
Line segment
Intersect
Convex Hull
Set of points
Fast Algorithm
Subset
Family
Line

Keywords

  • AMS subject classification code (1991): 52C10, 68Q20

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Mathematics(all)

Cite this

Aronov, B., Erdős, P., Goddard, W., Kleitman, D. J., Klugerman, M., Pach, J., & Schulman, L. J. (1994). Crossing families. Combinatorica, 14(2), 127-134. https://doi.org/10.1007/BF01215345

Crossing families. / Aronov, B.; Erdős, P.; Goddard, W.; Kleitman, D. J.; Klugerman, M.; Pach, J.; Schulman, L. J.

In: Combinatorica, Vol. 14, No. 2, 06.1994, p. 127-134.

Research output: Contribution to journalArticle

Aronov, B, Erdős, P, Goddard, W, Kleitman, DJ, Klugerman, M, Pach, J & Schulman, LJ 1994, 'Crossing families', Combinatorica, vol. 14, no. 2, pp. 127-134. https://doi.org/10.1007/BF01215345
Aronov B, Erdős P, Goddard W, Kleitman DJ, Klugerman M, Pach J et al. Crossing families. Combinatorica. 1994 Jun;14(2):127-134. https://doi.org/10.1007/BF01215345
Aronov, B. ; Erdős, P. ; Goddard, W. ; Kleitman, D. J. ; Klugerman, M. ; Pach, J. ; Schulman, L. J. / Crossing families. In: Combinatorica. 1994 ; Vol. 14, No. 2. pp. 127-134.
@article{8a98d11ff73547c8aa8e01012eb2b754,
title = "Crossing families",
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 sets A and B of points in the plane are mutually avoiding if no line subtended by a pair of points in A intersects the convex hull of B, and vice versa. We show that any set of n points in general position contains a pair of mutually avoiding subsets each of size at least {Mathematical expression}. As a consequence we show that such a set possesses a crossing family of size at least {Mathematical expression}, and describe a fast algorithm for finding such a family.",
keywords = "AMS subject classification code (1991): 52C10, 68Q20",
author = "B. Aronov and P. Erdős and W. Goddard and Kleitman, {D. J.} and M. Klugerman and J. Pach and Schulman, {L. J.}",
year = "1994",
month = "6",
doi = "10.1007/BF01215345",
language = "English",
volume = "14",
pages = "127--134",
journal = "Combinatorica",
issn = "0209-9683",
publisher = "Janos Bolyai Mathematical Society",
number = "2",

}

TY - JOUR

T1 - Crossing families

AU - Aronov, B.

AU - Erdős, P.

AU - Goddard, W.

AU - Kleitman, D. J.

AU - Klugerman, M.

AU - Pach, J.

AU - Schulman, L. J.

PY - 1994/6

Y1 - 1994/6

N2 - 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 sets A and B of points in the plane are mutually avoiding if no line subtended by a pair of points in A intersects the convex hull of B, and vice versa. We show that any set of n points in general position contains a pair of mutually avoiding subsets each of size at least {Mathematical expression}. As a consequence we show that such a set possesses a crossing family of size at least {Mathematical expression}, and describe a fast algorithm for finding such a family.

AB - 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 sets A and B of points in the plane are mutually avoiding if no line subtended by a pair of points in A intersects the convex hull of B, and vice versa. We show that any set of n points in general position contains a pair of mutually avoiding subsets each of size at least {Mathematical expression}. As a consequence we show that such a set possesses a crossing family of size at least {Mathematical expression}, and describe a fast algorithm for finding such a family.

KW - AMS subject classification code (1991): 52C10, 68Q20

UR - http://www.scopus.com/inward/record.url?scp=0003501716&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0003501716&partnerID=8YFLogxK

U2 - 10.1007/BF01215345

DO - 10.1007/BF01215345

M3 - Article

VL - 14

SP - 127

EP - 134

JO - Combinatorica

JF - Combinatorica

SN - 0209-9683

IS - 2

ER -