SKRW 2014 – Topics
Martin Held

Nontrivial lower bounds on the complexity of SK of a polygon.
SH: Polygons w/ holes: reduction to sorting holes along xaxis; Reduction on radially sorting motorcycles; No nontrivial lower bound for simple polygons other than , maybe optimal?

Better upper bounds on the complexity of SK of a polygon, or special classes of polygons.
SH: For arbitrary polygons, the best upper bound is still . For nondegenerate polygons it is expected time. If input is bit rational then , including nondegenerate polygons. Very recent arxiv paper: time for simple polygons and for a PSLG with components, if the mc graph is given. An efficient reduction of SK to MCG would be already interessting.

3D.
SH: Need to read the recent results by Gernot and Franz.
Therese Biedl

Study Cheng & Vigneron’s ESA’2014 paper.
They reduce the computation of straight skeletons of polygons to motorcycle graphs in time, which gives a randomized straight skeleton algorithm, where is the number of polygon holes, if the polygon is nondegenerate.

When is the straight skeleton of a polygon a caterpillar?
How quickly can we determine whether the straight skeleton of a polygon is a caterpillar?

Given a directed tree, can we find a polygon that has it as a straight skeleton?
We would like that the wavefront sweeps a directed tree edge according to its direction.

Impreciseinputtype straight skeleton computation.
The unstable nature of straight skeletons makes it harder to phrase a problem precisely. Maybe: Given a polygon, what is the smallest perturbation radius such that the combinatorial structure of the straight skeleton remains unchanged for all perturbations of polygon vertices?
Thomas Hackl

Pseudotriangulations for a faster straight skeleton algorithm.
SH: Though not following the punch line of pseudo triangulations, relevant related papers are Kaplan, Rubin, Sharir 2010 and Rubin 2013. Pseudotriangulations, which are related to efficient ray shooting, might be useful for both, motorcycle graphs and straight skeletons.