Recommendations
Cites work
- scientific article; zbMATH DE number 2185613 (Why is no real title available?)
- scientific article; zbMATH DE number 437554 (Why is no real title available?)
- scientific article; zbMATH DE number 4070353 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 1424297 (Why is no real title available?)
- scientific article; zbMATH DE number 1424308 (Why is no real title available?)
- scientific article; zbMATH DE number 3261634 (Why is no real title available?)
- A Fast Algorithm for Constructing Sparse Euclidean Spanners
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- A sparse graph almost as good as the complete graph on points in \(k\) dimensions
- An O(n log n) algorithm for the all-nearest-neighbors problem
- An output sensitive algorithm for discrete convex hulls
- Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees
- CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS
- Computational geometry. Algorithms and applications.
- ENUMERATING INTERDISTANCES IN SPACE
- Fault-tolerant geometric spanners
- Geometric Spanner Networks
- Graph spanners
- Improved algorithms for constructing fault-tolerant spanners
- Minimum Spanning Trees in k-Dimensional Space
- On separating systems
- �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten
Cited in
(20)- Vertex fault-tolerant spanners for weighted points in polygonal domains
- scientific article; zbMATH DE number 1775403 (Why is no real title available?)
- A spanner for the day after
- New constructions of SSPDs and their applications
- Map matching queries on realistic input graphs under the Fréchet distance
- Geometric spanners for weighted point sets
- On the power of the semi-separated pair decomposition
- Region-fault tolerant geometric spanners
- Vertex Fault-Tolerant Geometric Spanners for Weighted Points
- Fault-tolerant geometric spanners
- On the edge crossings of the greedy spanner
- Local geometric spanners
- On algorithmic complexity of imprecise spanners
- Local spanners revisited
- Light, reliable spanners
- Continuous Yao graphs
- Fault tolerancy of continuous Yao graph of angle less than 2/5
- Spanners for geodesic graphs and visibility graphs
- The Euclidean bottleneck Steiner path problem and other applications of ( , )-pair decomposition
- Distribution-sensitive construction of the greedy spanner
This page was built for publication: Region-fault tolerant geometric spanners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1016540)
