Affiliation:
1. Department of Computer Science, University of Wisconsin–Milwaukee, Milwaukee, WI, USA
Abstract
Let [Formula: see text] denote the degree [Formula: see text] dilation of a point set [Formula: see text] in the domain of plane geometric spanners. If [Formula: see text] is the infinite square lattice, it is shown that [Formula: see text] and [Formula: see text]. If [Formula: see text] is the infinite hexagonal lattice, it is shown that [Formula: see text] and [Formula: see text]. All our constructions are planar lattice tilings constrained to degree [Formula: see text] or [Formula: see text].
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Minimum weight Euclidean (1+ɛ)-spanners;European Journal of Combinatorics;2024-05
2. Bounded-Degree Plane Geometric Spanners in Practice;ACM Journal of Experimental Algorithmics;2023-04-08
3. Sparse hop spanners for unit disk graphs;Computational Geometry;2022-01
4. A note on optimal degree-three spanners of the square lattice;Discrete Mathematics, Algorithms and Applications;2021-05-24
5. Efficient Communication in Large Multi-robot Networks;2020 IEEE International Conference on Robotics and Automation (ICRA);2020-05