dc.citation.number |
3 |
- |
dc.citation.startPage |
44 |
- |
dc.citation.title |
ACM TRANSACTIONS ON ALGORITHMS |
- |
dc.citation.volume |
12 |
- |
dc.contributor.author |
Cheng, Siu-Wing |
- |
dc.contributor.author |
Mencel, Liam |
- |
dc.contributor.author |
Vigneron, Antoine |
- |
dc.date.accessioned |
2023-12-21T23:40:14Z |
- |
dc.date.available |
2023-12-21T23:40:14Z |
- |
dc.date.created |
2016-06-18 |
- |
dc.date.issued |
2016-06 |
- |
dc.description.abstract |
We present a new algorithm for computing the straight skeleton of a polygon. For a polygon with n vertices, among which r are reflex vertices, we give a deterministic algorithm that reduces the straight skeleton computation to a motorcycle graph computation in O(n(log n)log r) time. It improves on the previously best known algorithm for this reduction, which is randomized, and runs in expected O(nsqrth+ 1 log2n) time for a polygon with h holes. Using known motorcycle graph algorithms, our result yields improved time bounds for computing straight skeletons. In particular, we can compute the straight skeleton of a nondegenerate polygon in O(n(log n)log r + r4/3 + ϵ) time for any ϵ > 0. On degenerate input, our time bound increases to O(n(log n)log r + r17/11 + ϵ). |
- |
dc.identifier.bibliographicCitation |
ACM TRANSACTIONS ON ALGORITHMS, v.12, no.3, pp.44 |
- |
dc.identifier.doi |
10.1145/2898961 |
- |
dc.identifier.issn |
1549-6325 |
- |
dc.identifier.scopusid |
2-s2.0-84968813732 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/19928 |
- |
dc.identifier.url |
http://dl.acm.org/citation.cfm?id=2898961 |
- |
dc.identifier.wosid |
000379424200018 |
- |
dc.language |
영어 |
- |
dc.publisher |
ASSOC COMPUTING MACHINERY |
- |
dc.title |
A Faster Algorithm for Computing Straight Skeletons |
- |
dc.type |
Article |
- |
dc.description.journalRegisteredClass |
scie |
- |
dc.description.journalRegisteredClass |
scopus |
- |