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

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.

• Type: Conference
• Year: 2010
• Where: CCCG
• Authors: Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy, Sangameswar Patil, S. V. Rao
• Keywords: CCCG 2010, Computational Geometry, Initial Polygon, Simple Polygon, Straight Skeleton