Computational geometry: an introduction
Computational geometry: an introduction
Straight Skeletons for General Polygonal Figures in the Plane
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Efficient computation of continuous skeletons
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Linear axis for planar straight line graphs
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Tree transformation through vertex contraction with application to skeletons
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
On the structure of straight skeletons
Transactions on Computational Science VI
| Hi-index | 0.00 |
A linear axis is a skeleton recently introduced for simple polygons by Tanase and Veltkamp. It approximates the medial axis up to a certain degree, which is controlled by means of parameter Ɛ 0. A significant advantage of a linear axis is that its edges are straight line segments. We generalize the notion of a linear axis and the algorithm for its efficient computation to the case of general polygons, which might contain holes. We show that a linear axis Ɛ-equivalent to the medial axis can be computed from the latter in linear time for almost all general polygons. If the medial axis is not pre-computed, and the polygon contains holes, this implies O(n log n) total computation time for a linear axis.