Computing positively weighted straight skeletons of simple polygons based on a bisector arrangement
From MaRDI portal
Publication:1705648
DOI10.1016/j.ipl.2017.12.001zbMath1427.68334OpenAlexW2772698117MaRDI QIDQ1705648
Publication date: 16 March 2018
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2017.12.001
computational geometryline arrangementmotorcycle graphweighted straight skeletonwavefront propagation
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)
Related Items (3)
Implementing straight skeletons with exact arithmetic: challenges and experiences ⋮ Vector-Based Morphological Operations on Polygons Using Straight Skeletons for Digital Pathology ⋮ Recognizing Geometric Trees as Positively Weighted Straight Skeletons and Reconstructing Their Input
Cites Work
- Unnamed Item
- A faster algorithm for computing motorcycle graphs
- Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions
- Weighted straight skeletons in the plane
- On Computing Straight Skeletons by Means of Kinetic Triangulations
- A Faster Algorithm for Computing Straight Skeletons
- A FAST STRAIGHT-SKELETON ALGORITHM BASED ON GENERALIZED MOTORCYCLE GRAPHS
This page was built for publication: Computing positively weighted straight skeletons of simple polygons based on a bisector arrangement