Abstract
Let P be a set of n points in general position in the plane. Let R be a set of n points disjoint from P such that for every x, y∈ P the line through x and y contains a point in R outside of the segment delimited by x and y. We show that P∪ R must be contained in cubic curve. This resolves a special case of a conjecture of Milićević. We use the same approach to solve a special case of a problem of Karasev related to a bipartite version of the above problem.
| Original language | American English |
|---|---|
| Pages (from-to) | 905-915 |
| Number of pages | 11 |
| Journal | Discrete and Computational Geometry |
| Volume | 64 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 Oct 2020 |
Keywords
- Cubic curves
- Elliptic curves
- Line blocker
- Lines
- Points
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics