| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6874225 | Information Processing Letters | 2018 | 5 Pages |
Abstract
We extend the work by Huber and Held (IJCGA 2012) on straight-skeleton computation based on motorcycle graphs to positively weighted skeletons. Resorting to a line arrangement induced by the r reflex vertices of a simple n-vertex polygon P allows to compute the weighted straight skeleton of P in O(n2+r3k+nrlogâ¡n) time and O(n+kr) space, for an arbitrary positive integer kâ¤r.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Günther Eder, Martin Held,