Finding the maximum subset with bounded convex curvature
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Documents
- Finding the Maximum Subset with Bounded Convex Curvature
Final published version, 610 KB, PDF document
Original language | English |
---|---|
Title of host publication | 32nd International Symposium on Computational Geometry (SoCG 2016) |
Number of pages | 17 |
Publisher | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
Publication date | 2016 |
Article number | 4 |
ISBN (Print) | 978-3-95977-009-5 |
DOIs | |
Publication status | Published - 2016 |
Event | International Symposium on Computational Geometry (SoCG 2016) - Boston, MA, United States Duration: 14 Jun 2016 → 18 Jun 2016 Conference number: 32 |
Conference
Conference | International Symposium on Computational Geometry (SoCG 2016) |
---|---|
Nummer | 32 |
Land | United States |
By | Boston, MA |
Periode | 14/06/2016 → 18/06/2016 |
Series | Leibniz International Proceedings in Informatics |
---|---|
Volume | 51 |
ISSN | 1868-8969 |
Number of downloads are based on statistics from Google Scholar and www.ku.dk
No data available
ID: 164438996