Searching for Point Locations Using Lines

DOI10.1080/07468342.2023.2263074MaRDI QIDQ6151041zbMATH OpenOpenAlexFDO

Authors Michelle Cordier

Publication date 9 February 2024

Published in The College Mathematics Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2106.10149

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX)

Abstract: 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.

Recommendations

• A note on searching line arrangements and applications
• scientific article; zbMATH DE number 1140071
• Covering a Set of Points with a Minimum Number of Lines
• The ordinary line problem revisited
• Isolating points by lines in the plane

Cites work

• Geometric tomography
• Threesomes, degenerates, and love triangles

This page was built for publication: Searching for Point Locations Using Lines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151041)