Affiliation:
1. Department of Computer Science, University of Wisconsin–Milwaukee, Milwaukee, Wisconsin 53201, USA
Abstract
(I) We exhibit a set of 23 points in the plane that has dilation at least [Formula: see text], improving the previous best lower bound of [Formula: see text] for the worst-case dilation of plane spanners. (II) For every [Formula: see text], there exists an [Formula: see text]-element point set [Formula: see text] such that the degree [Formula: see text] dilation of [Formula: see text] equals [Formula: see text] in the domain of plane geometric spanners. In the same domain, we show that for every [Formula: see text], there exists a an [Formula: see text]-element point set [Formula: see text] such that the degree [Formula: see text] dilation of [Formula: see text] equals [Formula: see text] The previous best lower bound of [Formula: see text] holds for any degree. (III) For every [Formula: see text], there exists an [Formula: see text]-element point set [Formula: see text] such that the stretch factor of the greedy triangulation of [Formula: see text] is at least [Formula: see text].
Publisher
World Scientific Pub Co Pte Lt
Subject
Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献