Geodesic spanners for points on a polyhedral terrain
From MaRDI portal
Publication:5206937
Abstract: We show that there exists a geodesic spanner with almost linear number of edges.
Recommendations
Cites work
- An Optimal Dynamic Spanner for Doubling Metric Spaces
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Bypassing the embedding
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- Fully dynamic geometric spanners
- Geodesic spanners on polyhedral surfaces
- Geometric Spanner Networks
- Geometric Spanners for Points Inside a Polygonal Domain
- Geometric spanners for weighted point sets
- Kinetic spanners in \(\mathbb R^{d}\)
- On hierarchical routing in doubling metrics
- On sparse spanners of weighted graphs
- Searching dynamic point sets in spaces with bounded doubling dimension
- The Moore bound for irregular graphs
Cited in
(10)- Spanners of Additively Weighted Point Sets
- The complexity of geodesic spanners
- The complexity of geodesic spanners
- Geometric Spanners for Points Inside a Polygonal Domain
- Geodesic spanners for points on a polyhedral terrain
- Geodesic spanners on polyhedral surfaces
- Vertex Fault-Tolerant Geometric Spanners for Weighted Points
- Geodesic spanners for points in \(\mathbb{R}^3\) amid axis-parallel boxes
- Spanners for geodesic graphs and visibility graphs
- Spanners of additively weighted point sets
This page was built for publication: Geodesic spanners for points on a polyhedral terrain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206937)
