Bisecting three classes of lines

09/10/2019
by   Alexander Pilz, et al.
0

We consider the following problem: Let L be an arrangement of n lines in R^3 colored red, green, and blue. Does there exist a vertical plane P such that a line on P simultaneously bisects all three classes of points in the cross-section L∩ P? Recently, Schnider [SoCG 2019] used topological methods to prove that such a cross-section always exists. In this work, we give an alternative proof of this fact, using only methods from discrete geometry. With this combinatorial proof at hand, we devise an O(n^2log^2(n)) time algorithm to find such a plane and the bisector of the induced cross-section. We do this by providing a general framework, from which we expect that it can be applied to solve similar problems on cross-sections and kinetic points.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/21/2017

Balanced partitions of 3-colored geometric sets in the plane

Let S be a finite set of geometric objects partitioned into classes or c...
research
05/12/2020

Red-Blue Point Separation for Points on a Circle

Given a set R of red points and a set B of blue points in the plane, the...
research
08/22/2021

On a Tverberg graph

For a graph whose vertex set is a finite set of points in ℝ^d, consider ...
research
04/04/2019

Sharing a pizza: bisecting masses with two cuts

Assume you have a pizza consisting of four ingredients (e.g., bread, tom...
research
11/16/2021

A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines

Let L be a set of n lines in the plane. The zone Z(ℓ) of a line ℓ in the...
research
09/19/2022

Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours

In this paper, we study problems of connecting classes of points via non...
research
07/17/2018

Modularity Classes and Boundary Effects in Multivariate Stochastic Dominance

Hadar and Russell (1974) and Levy and Paroush (1974) presented sufficien...

Please sign up or login with your details

Forgot password? Click here to reset