Line Intersection Searching Amid Unit Balls in 3-Space

Pankaj K. Agarwal; Esther Ezra

doi:10.4230/LIPIcs.SoCG.2023.5

Line Intersection Searching Amid Unit Balls in 3-Space

Pankaj K. Agarwal, Esther Ezra

Department of Computer Science

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

Let B be a set of n unit balls in R³. We present a linear-size data structure for storing B that can determine in (Equation presented) 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(n log n) 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 R³. We preprocess L, in O^∗(n²) time, into a data structure of size O^∗(n²) that can determine in O^∗(1) 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
Title of host publication	39th International Symposium on Computational Geometry, SoCG 2023
Editors	Erin W. Chambers, Joachim Gudmundsson
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)	9783959772730
DOIs	https://doi.org/10.4230/LIPIcs.SoCG.2023.5
State	Published - 1 Jun 2023
Event	39th International Symposium on Computational Geometry, SoCG 2023 - Dallas, United States Duration: 12 Jun 2023 → 15 Jun 2023

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	258
ISSN (Print)	1868-8969

Conference

Conference	39th International Symposium on Computational Geometry, SoCG 2023
Country/Territory	United States
City	Dallas
Period	12/06/23 → 15/06/23

Bibliographical note

Publisher Copyright:
© Pankaj K. Agarwal and Esther Ezra; licensed under Creative Commons License CC-BY 4.0.

Keywords

Intersection searching
cylindrical range searching
partition trees
union of cylinders

Access to Document

10.4230/LIPIcs.SoCG.2023.5

Cite this

Agarwal, P. K., & Ezra, E. (2023). Line Intersection Searching Amid Unit Balls in 3-Space. In E. W. Chambers, & J. Gudmundsson (Eds.), 39th International Symposium on Computational Geometry, SoCG 2023 Article 5 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 258). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2023.5

@inproceedings{7eecdcb0847e4508aea408f1eca99412,

title = "Line Intersection Searching Amid Unit Balls in 3-Space",

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 (Equation presented) 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(n log n) 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∗(1) time whether a query unit ball intersects any line of L, or report all k such lines in additional O(k) time.",

keywords = "Intersection searching, cylindrical range searching, partition trees, union of cylinders",

author = "Agarwal, {Pankaj K.} and Esther Ezra",

note = "Publisher Copyright: {\textcopyright} Pankaj K. Agarwal and Esther Ezra; licensed under Creative Commons License CC-BY 4.0.; 39th International Symposium on Computational Geometry, SoCG 2023 ; Conference date: 12-06-2023 Through 15-06-2023",

year = "2023",

month = jun,

day = "1",

doi = "10.4230/LIPIcs.SoCG.2023.5",

language = "אנגלית",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Chambers, {Erin W.} and Joachim Gudmundsson",

booktitle = "39th International Symposium on Computational Geometry, SoCG 2023",

address = "גרמניה",

}

Agarwal, PK & Ezra, E 2023, Line Intersection Searching Amid Unit Balls in 3-Space. in EW Chambers & J Gudmundsson (eds), 39th International Symposium on Computational Geometry, SoCG 2023., 5, Leibniz International Proceedings in Informatics, LIPIcs, vol. 258, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 39th International Symposium on Computational Geometry, SoCG 2023, Dallas, United States, 12/06/23. https://doi.org/10.4230/LIPIcs.SoCG.2023.5

Line Intersection Searching Amid Unit Balls in 3-Space. / Agarwal, Pankaj K.; Ezra, Esther.
39th International Symposium on Computational Geometry, SoCG 2023. ed. / Erin W. Chambers; Joachim Gudmundsson. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2023. 5 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 258).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Line Intersection Searching Amid Unit Balls in 3-Space

AU - Agarwal, Pankaj K.

AU - Ezra, Esther

PY - 2023/6/1

Y1 - 2023/6/1

N2 - 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 (Equation presented) 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(n log n) 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∗(1) time whether a query unit ball intersects any line of L, or report all k such lines in additional O(k) time.

AB - 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 (Equation presented) 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(n log n) 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∗(1) time whether a query unit ball intersects any line of L, or report all k such lines in additional O(k) time.

KW - Intersection searching

KW - cylindrical range searching

KW - partition trees

KW - union of cylinders

UR - http://www.scopus.com/inward/record.url?scp=85163443868&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.SoCG.2023.5

DO - 10.4230/LIPIcs.SoCG.2023.5

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85163443868

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 39th International Symposium on Computational Geometry, SoCG 2023

A2 - Chambers, Erin W.

A2 - Gudmundsson, Joachim

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 39th International Symposium on Computational Geometry, SoCG 2023

Y2 - 12 June 2023 through 15 June 2023

ER -

Line Intersection Searching Amid Unit Balls in 3-Space

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this