@InProceedings{agarwal_et_al:LIPIcs.SoCG.2019.26,
author = {Agarwal, Pankaj K. and Cohen, Ravid and Halperin, Dan and Mulzer, Wolfgang},
title = {{Maintaining the Union of Unit Discs Under Insertions with Near-Optimal Overhead}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {26:1--26:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.26},
URN = {urn:nbn:de:0030-drops-104307},
doi = {10.4230/LIPIcs.SoCG.2019.26},
annote = {Keywords: lower envelopes, pseudo-lines, unit discs, range search, dynamic algorithms, tentative binary search}
}