A Faster Algorithm for Computing Straight Skeletons
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...
Main Author: | Mencel, Liam A. |
---|---|
Other Authors: | Vigneron, Antoine E. |
Language: | en |
Published: |
2014
|
Subjects: | |
Online Access: | Mencel, L. A. (2014). A Faster Algorithm for Computing Straight Skeletons. KAUST Research Repository. https://doi.org/10.25781/KAUST-O3U19 http://hdl.handle.net/10754/316713 |
Similar Items
-
A Straight Skeleton Based Connectivity Restoration Strategy in the Presence of Obstacles for WSNs
by: Xiaoding Wang, et al.
Published: (2017-10-01) -
Straight Skeleton Survey Adjustment Of Road Centerlines From Gps Coarse Acquisition Data: A Case Study In Bolivia
by: Raleigh, David Baring
Published: (2008) -
Algorithms for Computing Motorcycle Graphs
by: Yan, Lie
Published: (2013) -
Base Point Split Algorithm for Generating Polygon Skeleton Lines on the Example of Lakes
by: Elżbieta Lewandowicz, et al.
Published: (2020-11-01) -
Roof Geometry in Building Design
by: Koźniewski Edwin, et al.
Published: (2020-09-01)