| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331895 | Information Processing Letters | 2015 | 5 Pages |
Abstract
We study the characteristics of straight skeletons of monotone polygonal chains and use them to devise an algorithm for computing positively weighted straight skeletons of monotone polygons. Our algorithm runs in O(nlogâ¡n) time and O(n) space, where n denotes the number of vertices of the polygon.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader,