Recognizing Geometric Trees as Positively Weighted Straight Skeletons and Reconstructing Their Input

DOI10.1142/S0218195919500080zbMath1493.68372OpenAlexW2981998334WikidataQ126985693 ScholiaQ126985693MaRDI QIDQ5241380

Peter Palfrader, Günther Eder, Martin Held

Publication date: 31 October 2019

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

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

zbMATH Keywords

recognitionweighted straight skeletonbisector graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Motorcycle graphs and straight skeletons
• Computing positively weighted straight skeletons of simple polygons based on a bisector arrangement
• Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions
• Weighted straight skeletons in the plane
• Representing Directed Trees as Straight Skeletons
• A Faster Algorithm for Computing Straight Skeletons
• A FAST STRAIGHT-SKELETON ALGORITHM BASED ON GENERALIZED MOTORCYCLE GRAPHS

This page was built for publication: Recognizing Geometric Trees as Positively Weighted Straight Skeletons and Reconstructing Their Input