Abstract
Let B be a set of n unit balls in R3. We present a linear-size data structure for storing B that can determine in O∗(n) time whether a query line intersects any ball of B and report all k such balls in additional O(k) time. The data structure can be constructed in O(nlogn) time. (The O∗(·) notation hides subpolynomial factors, e.g., of the form O(nε), for arbitrarily small ε>0, and their coefficients which depend on ε.) We also consider the dual problem: Let L be a set of n lines in R3. We preprocess L, in O∗(n2) time, into a data structure of size O∗(n2) that can determine in O(logn) time whether a query unit ball intersects any line of L, or report all k such lines in additional O(k) time.
| Original language | English |
|---|---|
| Pages (from-to) | 223-241 |
| Number of pages | 19 |
| Journal | Algorithmica |
| Volume | 87 |
| Issue number | 2 |
| DOIs | |
| State | Published - Feb 2025 |
Bibliographical note
Publisher Copyright:© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.
Keywords
- Intersection searching
- Range searching
- Shallow partition trees
- Test sets
- Union of cylinders
Fingerprint
Dive into the research topics of 'Line Intersection Searching Amid Unit Balls in 3-Space'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver