Computing the straight skeleton of a monotone polygon in O(n log n) time

Abstract

The straight skeleton of a simple polygon is defined as the trace of the vertices when the initial polygon is shrunken in self-parallel manner [2]. In this paper, we propose a simple algorithm for drawing the straight skeleton of a monotone polygon. The time and space complexities of our algorithm are O(nlogn) and O(n) respectively. 

Topics

2 Figures and Tables

Cite this paper

@inproceedings{Das2010ComputingTS, title={Computing the straight skeleton of a monotone polygon in O(n log n) time}, author={Gautam K. Das and Asish Mukhopadhyay and Subhas C. Nandy and Sangameswar Patil and S. V. Rao}, booktitle={CCCG}, year={2010} }