7 research outputs found
Lower bounds on the dilation of plane spanners
(I) We exhibit a set of 23 points in the plane that has dilation at least
, improving the previously best lower bound of for the
worst-case dilation of plane spanners.
(II) For every integer , there exists an -element point set
such that the degree 3 dilation of denoted by in the domain of plane geometric spanners. In the
same domain, we show that for every integer , there exists a an
-element point set such that the degree 4 dilation of denoted by
The
previous best lower bound of holds for any degree.
(III) For every integer , there exists an -element point set
such that the stretch factor of the greedy triangulation of is at least
.Comment: Revised definitions in the introduction; 23 pages, 15 figures; 2
table
The Stretch Factor of the Delaunay Triangulation Is Less Than 1.998
Let be a finite set of points in the Euclidean plane. Let be a
Delaunay triangulation of . The {\em stretch factor} (also known as {\em
dilation} or {\em spanning ratio}) of is the maximum ratio, among all
points and in , of the shortest path distance from to in
over the Euclidean distance . Proving a tight bound on the stretch
factor of the Delaunay triangulation has been a long standing open problem in
computational geometry.
In this paper we prove that the stretch factor of the Delaunay triangulation
of a set of points in the plane is less than , improving the
previous best upper bound of 2.42 by Keil and Gutwin (1989). Our bound 1.998 is
better than the current upper bound of 2.33 for the special case when the point
set is in convex position by Cui, Kanj and Xia (2009). This upper bound breaks
the barrier 2, which is significant because previously no family of plane
graphs was known to have a stretch factor guaranteed to be less than 2 on any
set of points.Comment: 41 pages, 16 figures. A preliminary version of this paper appeared in
the Proceedings of the 27th Annual Symposium on Computational Geometry (SoCG
2011). This is a revised version of the previous preprint [v1
Drawing Graphs as Spanners
We study the problem of embedding graphs in the plane as good geometric
spanners. That is, for a graph , the goal is to construct a straight-line
drawing of in the plane such that, for any two vertices and
of , the ratio between the minimum length of any path from to
and the Euclidean distance between and is small. The maximum such
ratio, over all pairs of vertices of , is the spanning ratio of .
First, we show that deciding whether a graph admits a straight-line drawing
with spanning ratio , a proper straight-line drawing with spanning ratio
, and a planar straight-line drawing with spanning ratio are
NP-complete, -complete, and linear-time solvable problems,
respectively, where a drawing is proper if no two vertices overlap and no edge
overlaps a vertex.
Second, we show that moving from spanning ratio to spanning ratio
allows us to draw every graph. Namely, we prove that, for every
, every (planar) graph admits a proper (resp. planar) straight-line
drawing with spanning ratio smaller than .
Third, our drawings with spanning ratio smaller than have large
edge-length ratio, that is, the ratio between the length of the longest edge
and the length of the shortest edge is exponential. We show that this is
sometimes unavoidable. More generally, we identify having bounded toughness as
the criterion that distinguishes graphs that admit straight-line drawings with
constant spanning ratio and polynomial edge-length ratio from graphs that
require exponential edge-length ratio in any straight-line drawing with
constant spanning ratio
Stretch Factor in a Planar Poisson-Delaunay Triangulation with a Large Intensity
International audienceLet , where is a planar Poisson point process of intensity . We provide a first non-trivial lower bound for the distance between the expected length of the shortest path between (0, 0) and (1, 0) in the Delaunay triangulation associated with when the intensity of goes to infinity. Simulations indicate that the correct value is about 1.04. We also prove that the expected length of the so-called upper path converges to , giving an upper bound for the expected length of the smallest path
Constrained generalized Delaunay graphs are plane spanners
We look at generalized Delaunay graphs in the constrained setting by introducing line segments which the edges of the graph are not allowed to cross. Given an arbitrary convex shape C, a constrained Delaunay graph is constructed by adding an edge between two vertices p and q if and only if there exists a homothet of C with p and q on its boundary that does not contain any other vertices visible to p and q. We show that, regardless of the convex shape C used to construct the constrained Delaunay graph, there exists a constant t (that depends on C) such that it is a plane t-spanner of the visibility graph