Bounded-degree plane geometric spanners in practice
type: Item
instance of: scholarly article
title: Bounded-degree plane geometric spanners in practice
DOI: 10.1145/3582497
author: Frederick Anderson
author: Anirban Ghosh
author: Matthew Graham
author: Lucas Mougeot
author: David Wisnosky
published in: ACM Journal of Experimental Algorithmics
publication date: 2024-07-26T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7887802
zbMATH Keywords: geometric graph
zbMATH Keywords: plane spanner
zbMATH Keywords: stretch-factor
MaRDI profile type: MaRDI publication profile
cites work: Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
cites work: Fast Algorithms for Geometric Traveling Salesman Problems
cites work: Plane hop spanners for unit disk graphs: simpler and better
cites work: Towards plane spanners of degree 3
cites work: Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
cites work: Plane Spanners of Maximum Degree Six
cites work: The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations
cites work: There are plane spanners of degree 4 and moderate stretch factor
cites work: On bounded degree plane strong geometric spanners
cites work: Constructing plane spanners of bounded degree and low weight
cites work: Improved spanning ratio for low degree plane spanners
cites work: On plane geometric spanners: a survey and open problems
cites work: DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE
cites work: Practical and efficient algorithms for the geometric hitting set problem
cites work: A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
cites work: Planar Hop Spanners for Unit Disk Graphs
cites work: Approximating the average stretch factor of geometric graphs
cites work: There are planar graphs almost as good as the complete graph
cites work: CONSTRUCTING DEGREE-3 SPANNERS WITH OTHER SPARSENESS PROPERTIES
cites work: Lattice Spanners of Low Degree
cites work: Lower bounds on the dilation of plane spanners
cites work: Sparse hop spanners for unit disk graphs
cites work: Experimental study of geometric t -spanners
cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
cites work: Experiments with unit disk cover algorithms for covering massive pointsets
cites work: Degree four plane spanners: Simpler and better
cites work: On Spanners and Lightweight Spanners of Geometric Graphs
cites work: Improved local algorithms for spanner construction
cites work: Most finite point sets in the plane have dilation \(>1\)
cites work: EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER
cites work: Approximating the Stretch Factor of Euclidean Graphs
cites work: Geometric Spanner Networks
cites work: Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions
cites work: Q5358292
cites work: COMPUTING THE MAXIMUM DETOUR OF A PLANE GEOMETRIC GRAPH IN SUBQUADRATIC TIME
cites work: The stretch factor of the Delaunay triangulation is less than 1.998
description: scientific article; zbMATH DE number 7887802