Planar Matchings for Weighted Straight Skeletons
In this paper, we introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist.
Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings.
KeywordsPlanar matchings Pseudo-line arrangements Stable roommates Weighted straight skeletons
Unable to display preview. Download preview PDF.
- 1.Aichholzer, O., Alberts, D., Aurenhammer, F., Gärtner, B.: Straight Skeletons of Simple Polygons. In: Proc. 4th Int’l Symp. of LIESMARS, pp. 114–124 (1995)Google Scholar
- 3.Barequet, G., Eppstein, D., Goodrich, M.T., Vaxman, A.: Straight Skeletons of Three-Dimensional Polyhedra. In: Proc. 16th Annu. Europ. Symp. Algorithms, pp. 148–160 (September 2008)Google Scholar
- 8.Huber, S.: Computing Straight Skeletons and Motorcycle Graphs: Theory and Practice. Shaker Verlag (April 2012). ISBN: 978-3-8440-0938-5Google Scholar
- 10.Laycock, R., Day, A.: Automatically Generating Large Urban Environments Based on the Footprint Data of Buildings. In: Proc. 8th Symp. Solid Modeling Applications, pp. 346–351 (June 2003)Google Scholar