pdf-format: |
|
@InProceedings{david_et_al:LIPIcs:2018:8741, author = {Roee David and Karthik C. S. and Bundit Laekhanukit}, title = {{On the Complexity of Closest Pair via Polar-Pair of Point-Sets}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {28:1--28:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Bettina Speckmann and Csaba D. T{\'o}th}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8741}, URN = {urn:nbn:de:0030-drops-87412}, doi = {10.4230/LIPIcs.SoCG.2018.28}, annote = {Keywords: Contact dimension, Sphericity, Closest Pair, Fine-Grained Complexity} }
Keywords: | Contact dimension, Sphericity, Closest Pair, Fine-Grained Complexity | |
Seminar: | 34th International Symposium on Computational Geometry (SoCG 2018) | |
Issue date: | 2018 | |
Date of publication: | 08.06.2018 |