title: A simple algorithm for computing positively weighted straight skeletons of monotone polygons.
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 [Formula: see text] time and [Formula: see text] space, wherendenotes the number of vertices of the polygon.
authors: David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario N2L 1A2, Canada.
authors: Therese
authors: T
authors: Biedl
authors: Universität Salzburg, FB Computerwissenschaften, 5020 Salzburg, Austria.
authors: Martin
authors: M
authors: Held
authors: Institute of Science and Technology Austria, 3400 Klosterneuburg, Austria.
authors: Stefan
authors: S
authors: Huber
authors: Universität Salzburg, FB Computerwissenschaften, 5020 Salzburg, Austria.
authors: Dominik
authors: D
authors: Kaaser
authors: Universität Salzburg, FB Computerwissenschaften, 5020 Salzburg, Austria.
authors: Peter
authors: P
authors: Palfrader
keywords: Computational geometry; Lower envelope; Monotone polygon; Weighted straight skeleton
references: Comput Geom. 2015 Feb;48(2):120-133
references: 25648398