dc.citation.conferencePlace |
US |
- |
dc.citation.conferencePlace |
San Francisco |
- |
dc.citation.endPage |
165 |
- |
dc.citation.startPage |
156 |
- |
dc.citation.title |
13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002 |
- |
dc.contributor.author |
Cheng, Siu-Wing |
- |
dc.contributor.author |
Vigneron, Antoine |
- |
dc.date.accessioned |
2023-12-20T06:09:30Z |
- |
dc.date.available |
2023-12-20T06:09:30Z |
- |
dc.date.created |
2016-07-04 |
- |
dc.date.issued |
2002-01-06 |
- |
dc.description.abstract |
We present a new algorithm to compute a motorcycle graph. It runs in O(n√nlogn) time when n is the size of the input. We give a new characterization of the straight skeleton of a polygon possibly with holes. For a simple polygon, we show that it yields a randomized algorithm that reduces the straight skeleton computation to a motorcycle graph computation in O(nlog2n) time. Combining these results, we can compute the straight skeleton of a non-degenerate simple polygon with n vertices, among which r are reflex vertices, in O(nlog2n + r√logr) expected time. For a degenerate simple polygon, our expected time bound becomes O(nlog2n + r17/u+ϵ). |
- |
dc.identifier.bibliographicCitation |
13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002, pp.156 - 165 |
- |
dc.identifier.scopusid |
2-s2.0-84968911247 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/34497 |
- |
dc.identifier.url |
http://dl.acm.org/citation.cfm?id=545401&CFID=639749174&CFTOKEN=76434841 |
- |
dc.language |
영어 |
- |
dc.publisher |
13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002 |
- |
dc.title |
Motorcycle graphs and straight skeletons |
- |
dc.type |
Conference Paper |
- |
dc.date.conferenceDate |
2002-01-06 |
- |