Bounded-degree plane geometric spanners in practice
From MaRDI portal
Publication:6579765
DOI10.1145/3582497MaRDI QIDQ6579765FDOQ6579765
Authors: Frederick Anderson, Anirban Ghosh, Matthew Graham, Lucas Mougeot, David Wisnosky 
Publication date: 26 July 2024
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Geometric Spanner Networks
- There are planar graphs almost as good as the complete graph
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Fast Algorithms for Geometric Traveling Salesman Problems
- The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations
- Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces
- On spanners and lightweight spanners of geometric graphs
- Plane Spanners of Maximum Degree Six
- On plane geometric spanners: a survey and open problems
- DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE
- On bounded degree plane strong geometric spanners
- EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER
- CONSTRUCTING DEGREE-3 SPANNERS WITH OTHER SPARSENESS PROPERTIES
- Constructing plane spanners of bounded degree and low weight
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Improved local algorithms for spanner construction
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- The stretch factor of the Delaunay triangulation is less than 1.998
- Approximating the Stretch Factor of Euclidean Graphs
- Practical and efficient algorithms for the geometric hitting set problem
- Plane hop spanners for unit disk graphs: simpler and better
- Experimental study of geometric t -spanners
- Lower bounds on the dilation of plane spanners
- Sparse hop spanners for unit disk graphs
- Experiments with unit disk cover algorithms for covering massive pointsets
- There are plane spanners of degree 4 and moderate stretch factor
- Towards plane spanners of degree 3
- Degree four plane spanners: Simpler and better
- Improved spanning ratio for low degree plane spanners
- Planar Hop Spanners for Unit Disk Graphs
- Most finite point sets in the plane have dilation \(>1\)
- Approximating the average stretch factor of geometric graphs
- Lattice Spanners of Low Degree
- COMPUTING THE MAXIMUM DETOUR OF A PLANE GEOMETRIC GRAPH IN SUBQUADRATIC TIME
- Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions
This page was built for publication: Bounded-degree plane geometric spanners in practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579765)
