JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Straight Skeletons for General Polygonal Figures in the Plane
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Contour interpolation by straight skeletons
Graphical Models
Motorcycle Graphs and Straight Skeletons
Algorithmica
Linear axis for general polygons: properties and computation
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Linear axis for planar straight line graphs
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
| Hi-index | 0.00 |
For a planar straight line graph G, its straight skeleton S(G) can be partitioned into two subgraphs Sc(G) and Sr(G) traced out by the convex and by the reflex vertices of the linear wavefront, respectively. By further splitting Sc(G) at the nodes, at which the reflex wavefront vertices vanish, we obtain a set of connected subgraphs M1, ..., Mk of Sc(G). We show that each Mi is a pruned medial axis for a certain convex polygon Qi closely related to G, and give an optimal algorithm for computation of all those polygons, for 1≤i≤k. Here “pruned” means that Mi can be obtained from the medial axis M(Qi) for Qi by appropriately trimming some (if any) edges of M(Qi) incident to the leaves of the latter.