Geodesic Spanners for Points on a Polyhedral Terrain

DOI10.1137/18M119358XzbMath1430.52020arXiv1511.01612OpenAlexW2998615518WikidataQ126577624 ScholiaQ126577624MaRDI QIDQ5206937

Mohammad Javad Rezaei Seraji, Mohammad Ali Abam, Mark T. de Berg

Publication date: 19 December 2019

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

geometric spannersapproximation algorithmspolyhedral terrain

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Algorithms for approximation of functions (65D15)

Related Items

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

Cites Work

• Unnamed Item
• Kinetic spanners in \(\mathbb R^{d}\)
• Geometric spanners for weighted point sets
• On sparse spanners of weighted graphs
• The Moore bound for irregular graphs
• Searching dynamic point sets in spaces with bounded doubling dimension
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Geometric Spanner Networks
• An Optimal Dynamic Spanner for Doubling Metric Spaces
• Bypassing the embedding
• Geodesic Spanners on Polyhedral Surfaces
• Geometric Spanners for Points Inside a Polygonal Domain
• Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
• Fully dynamic geometric spanners