dc.citation.conferencePlace |
PL |
- |
dc.citation.conferencePlace |
Wroclaw, Poland |
- |
dc.citation.endPage |
283 |
- |
dc.citation.startPage |
272 |
- |
dc.citation.title |
22nd Annual European Symposium on Algorithms, ESA 2014 |
- |
dc.contributor.author |
Cheng, Siu-Wing |
- |
dc.contributor.author |
Mencel, Liam |
- |
dc.contributor.author |
Vigneron, Antoine |
- |
dc.date.accessioned |
2023-12-19T23:37:16Z |
- |
dc.date.available |
2023-12-19T23:37:16Z |
- |
dc.date.created |
2016-06-21 |
- |
dc.date.issued |
2014-09-10 |
- |
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 (logn)logr) time. It improves on the previously best known algorithm for this reduction, which is randomized, and runs in expected O (-rfnet√h+ 1 log2 n) 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 non-degenerate polygon in O(n (logn) logr+r 4/3+ε ) time for any ε>0. On degenerate input, our time bound increases to O(n (logn) logr+ r17/11+ε ). |
- |
dc.identifier.bibliographicCitation |
22nd Annual European Symposium on Algorithms, ESA 2014, pp.272 - 283 |
- |
dc.identifier.doi |
10.1007/978-3-662-44777-2_23 |
- |
dc.identifier.issn |
0302-9743 |
- |
dc.identifier.scopusid |
2-s2.0-84958543164 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/34390 |
- |
dc.identifier.url |
http://algo2014.ii.uni.wroc.pl/esa/ |
- |
dc.language |
영어 |
- |
dc.publisher |
22nd Annual European Symposium on Algorithms, ESA 2014 |
- |
dc.title |
A faster algorithm for computing straight skeletons |
- |
dc.type |
Conference Paper |
- |
dc.date.conferenceDate |
2014-09-08 |
- |