$$\beta $$-skeletons for a Set of Line Segments in $$R^2 $$

DOI10.1007/978-3-319-22177-9_6zbMath1434.68610arXiv1411.5457OpenAlexW1920187469MaRDI QIDQ2947870

Gabriela Majewska, Mirosław Kowaluk

Publication date: 29 September 2015

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.5457

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• The relative neighbourhood graph of a finite planar set
• A linear-time construction of the relative neighborhood graph from the Delaunay triangulation
• Beta-skeletons have unbounded dilation
• Optimal and suboptimal robust algorithms for proximity graphs
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• Triangulations of Line Segment Sets in the Plane
• Straight skeletons for general polygonal figures in the plane

This page was built for publication: $$\beta $$-skeletons for a Set of Line Segments in $$R^2 $$