Type
Conference PaperKAUST Department
Computer Science ProgramComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Visual Computing Center (VCC)
Date
2014-08-16Preprint Posting Date
2014-05-19Online Publication Date
2014-08-16Print Publication Date
2014Permanent link to this record
http://hdl.handle.net/10754/348465
Metadata
Show full item recordAbstract
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(n√h+1log2n) 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 + r 17/11 + ε ).Citation
Cheng, Siu-Wing, Liam Mencel, and Antoine Vigneron. "A faster algorithm for computing straight skeletons." Algorithms-ESA 2014. Springer Berlin Heidelberg, 2014. 272-283Publisher
Springer NatureConference/Event name
22nd Annual European Symposium on Algorithms, ESA 2014arXiv
1405.4691Additional Links
http://link.springer.com/chapter/10.1007/978-3-662-44777-2_23http://arxiv.org/abs/1405.4691
ae974a485f413a2113503eed53cd6c53
10.1007/978-3-662-44777-2_23