Geodesic spanners for points in \(\mathbb{R}^3\) amid axis-parallel boxes
From MaRDI portal
Publication:2224857
DOI10.1016/j.ipl.2020.106063zbMath1506.68168arXiv2004.01599OpenAlexW3021725215MaRDI QIDQ2224857
Mohammad Javad Rezaei Seraji, Mohammad Ali Abam
Publication date: 4 February 2021
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.01599
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
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
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Spanners for geodesic graphs and visibility graphs
- Walking around fat obstacles.
- Searching dynamic point sets in spaces with bounded doubling dimension
- Geometric Spanner Networks
- An Optimal Dynamic Spanner for Doubling Metric Spaces
- Bypassing the embedding
- Geodesic Spanners for Points on a Polyhedral Terrain
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications