Computation of Straight Skeleton of Simple Polygon.

Date of Submission

December 2002

Date of Award

Winter 12-12-2003

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Advance Computing and Microelectronics Unit (ACMU-Kolkata)


Nandy, Subhas Chandra (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

In 1995 Aichholzer et al. [2] introduced a new kind of skeleton for a polygon. It is defined as the trace of the vertices when the initial polygon is shrunken in self- parallel manner. Straight skeleton has only straight line segments which could be useful when parabolic edges of medial axis need to be avoided. Straight skeleton provides a canonical solution to thẻ problem of roof construction in the architecture field. The straight skeleton may prove useful for other applications of the medial axis, for instance, shape recognition and terrain reconstruction from a river network as well.The geometry of the straight skeleton is still not well understood and it is unclear whether the best known algorithm is close to optimal. We implement an O(n2) time algorithm for drawing straight skeleton of an arbitrary simple polygon. Next, we studied the special case where the polygon is monotone with respect to a cor axis. On the basis of some important observations, we conjecture that poss. worst case time complexity of computing the straight skeleton for a monotone polygon is O(nlogn). We executed our algorithm on randomly generated monotone pol--ons. Experimental results justify our conjecture.


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.