Computing positively weighted straight skeletons of simple polygons based on a bisector arrangement
DOI10.1016/J.IPL.2017.12.001zbMATH Open1427.68334OpenAlexW2772698117MaRDI QIDQ1705648FDOQ1705648
Authors: Günther Eder, M. Held 
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
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions
- Weighted straight skeletons in the plane
- A fast straight-skeleton algorithm based on generalized motorcycle graphs
- On computing straight skeletons by means of kinetic triangulations
- A faster algorithm for computing straight skeletons
Cited In (6)
- Weighted straight skeletons in the plane
- 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
- A simple algorithm for computing positively weighted straight skeletons of monotone polygons
- Planar matchings for weighted straight skeletons
This page was built for publication: Computing positively weighted straight skeletons of simple polygons based on a bisector arrangement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1705648)
