dc.citation.conferencePlace |
BL |
- |
dc.citation.conferencePlace |
Rio de Janeiro |
- |
dc.citation.endPage |
26 |
- |
dc.citation.startPage |
17 |
- |
dc.citation.title |
29th Annual Symposium on Computational Geometry, SoCG 2013 |
- |
dc.contributor.author |
Vigneron, Antoine |
- |
dc.contributor.author |
Yan, Lie |
- |
dc.date.accessioned |
2023-12-20T01:06:10Z |
- |
dc.date.available |
2023-12-20T01:06:10Z |
- |
dc.date.created |
2016-06-21 |
- |
dc.date.issued |
2013-06-17 |
- |
dc.description.abstract |
We present a new algorithm for computing motorcycle graphs that runs in O(n4/3+ε) time for any ε > 0, improving on all previously known algorithms. The main application of this result is to computing the straight skeleton of a polygon. It allows us to compute the straight skeleton of a non-degenerate polygon with h holes in O(n√h+1 log 2 n + n4/3+ε) expected time. If all input coordinates are O(logn)-bit rational numbers, we can compute the straight skeleton of a (possibly degenerate) polygon with h holes in expected time O(n√h+1 log3n). In particular, it means that we can compute the straight skeleton of a simple polygon in O(nlog3n) expected time if all input coordinates are O(log n)-bit rationals, while all previously known algorithms have worst-case running time ω(n3/2). |
- |
dc.identifier.bibliographicCitation |
29th Annual Symposium on Computational Geometry, SoCG 2013, pp.17 - 26 |
- |
dc.identifier.scopusid |
2-s2.0-84879619884 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/34411 |
- |
dc.language |
영어 |
- |
dc.publisher |
29th Annual Symposium on Computational Geometry, SoCG 2013 |
- |
dc.title |
A faster algorithm for computing motorcycle graphs |
- |
dc.type |
Conference Paper |
- |
dc.date.conferenceDate |
2013-06-17 |
- |