Geometric Spanner Networks

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

Geometric Spanner of Segments
A geometric spanner of segments
scientific article; zbMATH DE number 1263225
Geometric Spanner of Objects under L 1 Distance
The emergence of sparse spanners and well-separated pair decomposition under anarchy

Cited in

(only showing first 100 items - show all)

Light orthogonal networks with constant geometric dilation
Region-fault tolerant geometric spanners
Computing the dilation of edge-augmented graphs in metric spaces
Constrained generalized Delaunay graphs are plane spanners
(Weakly) self-approaching geometric graphs and spanners
An exact algorithm for the minimum dilation triangulation problem
Fault-tolerant spanners in networks with symmetric directional antennas
Tree spanners of bounded degree graphs
Continuous Yao graphs
Minimum rectilinear Steiner tree of n points in the unit square
Spanners for geodesic graphs and visibility graphs
Locating battery charging stations to facilitate almost shortest paths
Faster force-directed graph drawing with the well-separated pair decomposition
Computational complexity of the vertex cover problem in the class of planar triangulations
Approximating the generalized minimum Manhattan network problem
On the power of the semi-separated pair decomposition
On the stretch factor of randomly embedded random graphs
Computing the greedy spanner in near-quadratic time
Graph spanners: a tutorial review
Temporal cliques admit sparse spanners
Local geometric spanners
Light spanners for high dimensional norms via stochastic decompositions
Local routing in sparse and lightweight geometric graphs
On the spanning and routing ratios of the directed _6-graph
Routing among convex polygonal obstacles in the plane
Covering metric spaces by few trees
Routing in polygonal domains
Spanning properties of Theta-Theta-6
Plane hop spanners for unit disk graphs: simpler and better
Bounded-degree spanners in the presence of polygonal obstacle
A spanner for the day after
Geodesic spanners for points in \(\mathbb{R}^3\) amid axis-parallel boxes
Quickest path queries on transportation network
Most finite point sets in the plane have dilation \(>1\)
Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree
Conic nearest neighbor queries and approximate Voronoi diagrams
The \(\varTheta_5\)-graph is a spanner
Minimizing the sum of distances to a server in a constraint network
An improved upper bound on dilation of regular polygons
Geometric spanner games
Average stretch factor: how low does it go?
Reprint of: Theta-3 is connected
Fast algorithms for approximate Fréchet matching queries in geometric trees
Upper and lower bounds for online routing on Delaunay triangulations
Fault tolerancy of continuous Yao graph of angle less than 2/5
Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm
On certain geometric properties of the Yao-Yao graphs
The Euclidean bottleneck Steiner path problem and other applications of ( , )-pair decomposition
A rounding algorithm for approximating minimum Manhattan networks
Optimizing budget allocation for center and median points
A lower bound for computing geometric spanners
Near isometric terminal embeddings for doubling metrics
On path-greedy geometric spanners
On approximating tree spanners that are breadth first search trees
Lattice spanners of low degree
Lattice spanners of low degree
New Doubling Spanners: Better and Simpler
Gabriel triangulations and angle-monotone graphs: local routing and recognition
Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas
Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces
Yao graphs span theta graphs
On the Power of the Semi-Separated Pair Decomposition
Connect the Dot: Computing Feed-Links with Minimum Dilation
Computing minimum dilation spanning trees in geometric graphs
Models and algorithms for network reduction
Upper and lower bounds for online routing on Delaunay triangulations
Spanners of Additively Weighted Point Sets
Computing the Greedy Spanner in Near-Quadratic Time
On the expected maximum degree of Gabriel and Yao graphs
Computing geometric minimum-dilation graphs is NP-hard
On plane geometric spanners: a survey and open problems
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
ON SPANNERS OF GEOMETRIC GRAPHS
DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE
The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension
Fast query structures in anisotropic media
Theta-3 is connected
Minimum weight Euclidean t-spanner is NP-hard
New constructions of SSPDs and their applications
The MST of symmetric disk graphs is light
On bounded degree plane strong geometric spanners
Spanners for directed transmission graphs
Optimal network design with end-to-end service requirements
Computing the stretch factor and maximum detour of paths, trees, and cycles in the normed space
Testing Euclidean Spanners
The greedy spanner is existentially optimal
On the stretch factor of polygonal chains
Maximum area axis-aligned square packings
Improved routing on the Delaunay triangulation
Light spanners for high dimensional norms via stochastic decompositions
Euclidean Steiner spanners: light and sparse
Angle-constrained spanners with angle at least \(\pi/3\)
Truly Optimal Euclidean Spanners
A spanner for the day after
Approximating Distance Measures for the Skyline
Covering Metric Spaces by Few Trees
Temporal cliques admit sparse spanners
On the stretch factor of polygonal chains
Near isometric terminal embeddings for doubling metrics
Odd Yao-Yao graphs are not spanners

This page was built for publication: Geometric Spanner Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3445775)