Planar Matchings for Weighted Straight Skeletons

DOI10.1142/S0218195916600050zbMath1407.68504OpenAlexW3022463586MaRDI QIDQ5892452

Peter Palfrader, Stefan Huber, Therese C. Biedl

Publication date: 19 May 2017

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195916600050

zbMATH Keywords

stable roommatespseudo-line arrangementsplanar matchingsweighted straight skeletons

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Related Items (1)

Min-/Max-Volume Roofs Induced by Bisector Graphs of Polygonal Footprints of Buildings

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for generalized stable marriage and roommates problems
• A generalization of the stable matching problem
• Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions
• Weighted straight skeletons in the plane
• Weighted skeletons and fixed-share decomposition
• A necessary and sufficient condition for the existence of a complete stable matching
• Straight Skeletons of Three-Dimensional Polyhedra
• Detecting Weakly Simple Polygons

This page was built for publication: Planar Matchings for Weighted Straight Skeletons