Searching for Point Locations using Lines

06/18/2021
by   Michelle Cordier, et al.
0

Versions of the following problem appear in several topics such as Gamma Knife radiosurgery, studying objects with the X-ray transform, the 3SUM problem, and the k-linear degeneracy testing. Suppose there are n points on a plane whose specific locations are unknown. We are given all the lines that go through the points with a given slope. We show that the minimum number of slopes needed, in general, to find all the point locations is n+1 and we provide an algorithm to do so.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/06/2017

On Separating Points by Lines

Given a set P of n points in the plane, its separability is the minimum ...
research
10/02/2017

On the Parameterized Complexity of Red-Blue Points Separation

We study the following geometric separation problem: Given a set R of ...
research
07/21/2021

Separating Colored Points with Minimum Number of Rectangles

In this paper we study the following problem: Given k disjoint sets of p...
research
08/11/2020

Catching a Polygonal Fish with a Minimum Net

Given a polygon P in the plane that can be translated, rotated and enlar...
research
02/14/2021

Optimal design of optical analog solvers of linear systems

In this paper, given a linear system of equations A x = b, we are findin...
research
03/05/2020

Optimal Discretization is Fixed-parameter Tractable

Given two disjoint sets W_1 and W_2 of points in the plane, the Optimal ...
research
05/17/2020

Output sensitive algorithms for approximate incidences and their applications

An ϵ-approximate incidence between a point and some geometric object (li...

Please sign up or login with your details

Forgot password? Click here to reset