A simple algorithm for computing positively weighted straight skeletons of monotone polygons☆

https://doi.org/10.1016/j.ipl.2014.09.021Get rights and content
Under a Creative Commons license
open access

Highlights

  • •

    We study the characteristics of the straight skeleton (SK) of monotone polygons.

  • •

    We devise an algorithm to compute the SK of monotone polygons in O(nlog⁡n) time.

  • •

    This algorithm can also compute the positively weighted SK in O(nlog⁡n) time.

Abstract

We study the characteristics of straight skeletons of monotone polygonal chains and use them to devise an algorithm for computing positively weighted straight skeletons of monotone polygons. Our algorithm runs in O(nlog⁡n) time and O(n) space, where n denotes the number of vertices of the polygon.

Keywords

Computational geometry
Weighted straight skeleton
Monotone polygon
Lower envelope

Cited by (0)

☆

Research of Therese Biedl was supported by NSERC and undertaken while visiting the University of Salzburg. Martin Held and Peter Palfrader were supported by Austrian Science Fund (FWF): P25816-N15.

Copyright © 2014 The Authors. Published by Elsevier B.V.