@InProceedings{agarwal_et_al:LIPIcs.ESA.2024.7,
author = {Agarwal, Pankaj K. and Kaplan, Haim and Katz, Matthew J. and Sharir, Micha},
title = {{Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {7:1--7:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.7},
URN = {urn:nbn:de:0030-drops-210782},
doi = {10.4230/LIPIcs.ESA.2024.7},
annote = {Keywords: segment proximity graphs, nearest neighbor searching, dynamic data structures, BFS, DFS, unit-disk graphs}
}