Spanners for geodesic graphs and visibility graphs

DOI10.1007/s00453-016-0268-yzbMath1390.68699OpenAlexW2582648736MaRDI QIDQ1709579

Mohammad Ali Abam

Publication date: 6 April 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-016-0268-y

zbMATH Keywords

spannerspolygonal domainsgeodesic distancevisibility graphs

Mathematics Subject Classification ID

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

Related Items (2)

Vertex Fault-Tolerant Geometric Spanners for Weighted Points ⋮ Geodesic spanners for points in \(\mathbb{R}^3\) amid axis-parallel boxes

Cites Work

• Unnamed Item
• Unnamed Item
• New constructions of SSPDs and their applications
• Geometric spanners for weighted point sets
• Combinatorial complexity bounds for arrangements of curves and spheres
• Region-fault tolerant geometric spanners
• Applications of a new space-partitioning technique
• On sparse spanners of weighted graphs
• On the power of the semi-separated pair decomposition
• Geometric Spanner Networks
• Bypassing the embedding
• Planar Separators
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Fast Construction of Nets in Low-Dimensional Metrics and Their Applications

This page was built for publication: Spanners for geodesic graphs and visibility graphs