@InProceedings{abrahamsen_et_al:LIPIcs.SoCG.2016.4,
author = {Abrahamsen, Mikkel and Thorup, Mikkel},
title = {{Finding the Maximum Subset with Bounded Convex Curvature}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {4:1--4:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.4},
URN = {urn:nbn:de:0030-drops-58960},
doi = {10.4230/LIPIcs.SoCG.2016.4},
annote = {Keywords: planar computational geometry, bounded curvature, pocket machining}
}