On Mutually Avoiding Sets

Pavel Valtr ()
Additional contact information
Pavel Valtr: Charles University, Department of Applied Mathematics and Institute for Computer Science (ITI)

A chapter in The Mathematics of Paul Erdős I, 2013, pp 559-563 from Springer

Abstract: Summary Two finite sets of points in the plane are called mutually avoiding if any straight line passing through two points of any one of these two sets does not intersect the convex hull of the other set. For any integer n, we construct a set of n points in general position in the plane which contains no pair of mutually avoiding sets of size more than $$\mathcal{O}(\sqrt{n})$$ each. The given bound is tight up to a constant factor, since Aronov et al. [1] showed a polynomial-time algorithm for finding two mutually avoiding sets of size $$\Omega (\sqrt{n})$$ each in any set of n points in general position in the plane.

Keywords: Line Segment; Convex Hull; Minimum Distance; Convex Subset; General Position (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-7258-2_36

Ordering information: This item can be ordered from
http://www.springer.com/9781461472582

DOI: 10.1007/978-1-4614-7258-2_36

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().