On sets of n points in general position that determine lines that can be pierced by n points

08/18/2019
by   Chaya Keller, et al.
0

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 a cubic curve.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/07/2018

Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets

Let R and B be a set of red points and a set of blue points in the plane...
research
04/03/2018

The exact chromatic number of the convex segment disjointness graph

Let P be a set of n points in strictly convex position in the plane. Let...
research
08/09/2021

Topological Art in Simple Galleries

Let P be a simple polygon, then the art gallery problem is looking for a...
research
07/20/2020

Rainbow polygons for colored point sets in the plane

Given a colored point set in the plane, a perfect rainbow polygon is a s...
research
01/30/2021

The Dimension Spectrum Conjecture for Planar Lines

Let L_a,b be a line in the Euclidean plane with slope a and intercept b....
research
12/21/2018

Polygonal approximation of digital planar curve using novel significant measure

This paper presents an iterative smoothing technique for polygonal appro...
research
07/15/2020

Empty Rainbow Triangles in k-colored Point Sets

Let S be a set of n points in general position in the plane. Suppose tha...

Please sign up or login with your details

Forgot password? Click here to reset