Planar Matchings for Weighted Straight Skeletons

DOI10.1007/978-3-319-13075-0_10zbMath1407.68503OpenAlexW2606841858MaRDI QIDQ5892115

Stefan Huber, Peter Palfrader, Therese C. Biedl

Publication date: 11 September 2015

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13075-0_10

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 (2)

A simple algorithm for computing positively weighted straight skeletons of monotone polygons ⋮ Implementing straight skeletons with exact arithmetic: challenges and experiences

Cites Work

• 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

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