7 research outputs found
Computing a Minimum-Dilation Spanning Tree is NP-hard
In a geometric network G = (S, E), the graph distance between two vertices u,
v in S is the length of the shortest path in G connecting u to v. The dilation
of G is the maximum factor by which the graph distance of a pair of vertices
differs from their Euclidean distance. We show that given a set S of n points
with integer coordinates in the plane and a rational dilation delta > 1, it is
NP-hard to determine whether a spanning tree of S with dilation at most delta
exists
Improving the dilation of a metric graph by adding edges
Most of the literature on spanners focuses on building the graph from
scratch. This paper instead focuses on adding edges to improve an existing
graph. A major open problem in this field is: given a graph embedded in a
metric space, and a budget of k edges, which k edges do we add to produce a
minimum-dilation graph? The special case where k=1 has been studied in the
past, but no major breakthroughs have been made for k > 1. We provide the first
positive result, an O(k)-approximation algorithm that runs in O(n^3 \log n)
time
Spanners of Additively Weighted Point Sets
We study the problem of computing geometric spanners for (additively)
weighted point sets. A weighted point set is a set of pairs where
is a point in the plane and is a real number. The distance between two
points and is defined as . We show
that in the case where all are positive numbers and for all (in which case the points can be seen as
non-intersecting disks in the plane), a variant of the Yao graph is a
-spanner that has a linear number of edges. We also show that the
Additively Weighted Delaunay graph (the face-dual of the Additively Weighted
Voronoi diagram) has constant spanning ratio. The straight line embedding of
the Additively Weighted Delaunay graph may not be a plane graph. We show how to
compute a plane embedding that also has a constant spanning ratio
Geometric Dilation and Halving Distance
Let us consider the network of streets of a city represented by a geometric graph G in the plane. The vertices of G represent the crossroads and the edges represent the streets. The latter do not have to be straight line segments, they may be curved. If one wants to drive from a place p to some other place q, normally the length of the shortest path along streets, d_G(p,q), is bigger than the airline distance (Euclidean distance) |pq|. The (relative) DETOUR is defined as delta_G(p,q) := d_G(p,q)/|pq|. The supremum of all these ratios is called the GEOMETRIC DILATION of G. It measures the quality of the network. A small dilation value guarantees that there is no bigger detour between any two points. Given a finite point set S, we would like to know the smallest possible dilation of any graph that contains the given points on its edges. We call this infimum the DILATION of S and denote it by delta(S). The main results of this thesis are - a general upper bound to the dilation of any finite point set S, delta(S) - a lower bound for a specific set P, delta(P)>(1+10^(-11))pi/2, which approximately equals 1.571 In order to achieve these results, we first consider closed curves. Their dilation depends on the HALVING PAIRS, pairs of points which divide the closed curve in two parts of equal length. In particular the distance between the two points is essential, the HALVING DISTANCE. A transformation technique based on halving pairs, the HALVING PAIR TRANSFORMATION, and the curve formed by the midpoints of the halving pairs, the MIDPOINT CURVE, help us to derive lower bounds to dilation. For constructing graphs of small dilation, we use ZINDLER CURVES. These are closed curves of constant halving distance. To give a structured overview, the mathematical apparatus for deriving the main results of this thesis includes - upper bound: * the construction of certain Zindler curves to generate a periodic graph of small dilation * an embedding argument based on a number theoretical result by Dirichlet - lower bound: * the formulation and analysis of the halving pair transformation * a stability result for the dilation of closed curves based on this transformation and the midpoint curve * the application of a disk-packing result In addition, this thesis contains - a detailed analysis of the dilation of closed curves - a collection of inequalities, which relate halving distance to other important quantities from convex geometry, and their proofs; including four new inequalities - the rediscovery of Zindler curves and a compact presentation of their properties - a proof of the applied disk packing result.Geometrische Dilation und Halbierungsabstand Man kann das von den Straßen einer Stadt gebildete Netzwerk durch einen geometrischen Graphen in der Ebene darstellen. Die Knoten dieses Graphen repräsentieren die Kreuzungen und die Kanten sind die Straßen. Letztere müssen nicht geradlinig sein, sondern können beliebig gekrümmt sein. Wenn man nun von einem Ort p zu einem anderen Ort q fahren möchte, dann ist normalerweise die Länge des kürzesten Pfades über Straßen, d_G(p,q), länger als der Luftlinienabstand (euklidischer Abstand) |pq|. Der (relative) UMWEG (DETOUR) ist definiert als delta_G(p,q) := d_G(p,q)/|pq|. Das Supremum all dieser Brüche wird GEOMETRISCHE DILATION (GEOMETRIC DILATION) von G genannt. Es ist ein Maß für die Qualität des Straßennetzes. Ein kleiner Dilationswert garantiert, dass es keinen größeren Umweg zwischen beliebigen zwei Punkten gibt. Für eine gegebene endliche Punktmenge S würden wir nun gerne bestimmen, was der kleinste Dilationswert ist, den wir mit einem Graphen erreichen können, der die gegebenen Punkte auf seinen Kanten enthält. Dieses Infimum nennen wir die DILATION von S und schreiben kurz delta(S). Die Haupt-Ergebnisse dieser Arbeit sind - eine allgemeine obere Schranke für die Dilation jeder beliebigen endlichen Punktmenge S: delta(S) - eine untere Schranke für eine bestimmte Menge P: delta(P)>(1+10^(-11))pi/2, was ungefähr der Zahl 1.571 entspricht Um diese Ergebnisse zu erreichen, betrachten wir zunächst geschlossene Kurven. Ihre Dilation hängt von sogenannten HALBIERUNGSPAAREN (HALVING PAIRS) ab. Das sind Punktpaare, die die geschlossene Kurve in zwei Teile gleicher Länge teilen. Besonders der Abstand der beiden Punkte ist von Bedeutung, der HALBIERUNGSABSTAND (HALVING DISTANCE). Eine auf den Halbierungspaaren aufbauende Transformation, die HALBIERUNGSPAARTRANSFORMATION (HALVING PAIR TRANSFORMATION), und die von den Mittelpunkten der Halbierungspaare gebildete Kurve, die MITTELPUNKTKURVE (MIDPOINT CURVE), helfen uns untere Dilationsschranken herzuleiten. Zur Konstruktion von Graphen mit kleiner Dilation benutzen wir ZINDLERKURVEN (ZINDLER CURVES). Dies sind geschlossene Kurven mit konstantem Halbierungspaarabstand. Die mathematischen Hilfsmittel, mit deren Hilfe wir schließlich die Hauptresultate beweisen, sind unter anderem - obere Schranke: * die Konstruktion von bestimmten Zindlerkurven, mit denen periodische Graphen kleiner Dilation gebildet werden können * ein Einbettungsargument, das einen zahlentheoretischen Satz von Dirichlet benutzt - untere Schranke: * die Definition und Analyse der Halbierungspaartransformation * ein Stabilitätsresultat für die Dilation geschlossener Kurven, das auf dieser Transformation und der Mittelpunktkurve basiert * die Anwendung eines Kreispackungssatzes Zusätzlich enthält diese Dissertation - eine detaillierte Analyse der Dilation geschlossener Kurven - eine Sammlung von Ungleichungen, die den Halbierungsabstand zu anderen wichtigen Größen der Konvexgeometrie in Beziehung setzen, und ihre Beweise; inklusive vier neuer Ungleichungen - die Wiederentdeckung von Zindlerkurven und eine kompakte Darstellung ihrer Eigenschaften - einen Beweis des angewendeten Kreispackungssatzes
On spanners of geometric graphs
Given a connected geometric graph G, we consider the problem of constructing a t-spanner of G having the minimum number of edges. We prove that for every real number t with , there exists a connected geometric graph G with n vertices, such that every t-spanner of G contains Ω(n1+1/t) edges. This bound almost matches the known upper bound, which states that every connected weighted graph with n vertices contains a t-spanner with O(n1+2/(t-1)) edges. We also prove that the problem of deciding whether a given geometric graph contains a t-spanner with at most K edges is NP-hard. Previously, this NP-hardness result was only known for non-geometric graphs
On Spanners of Geometric Graphs
Given a connected geometric graph G, we consider the problem of constructing a t-spanner of G having the minimum number of edges. We prove that for every t with 1 1+1/t) edges. This bound almost matches the known upper bound, which states that every connected weighted graph with n vertices contains a t-spanner with O(tn1+2/(t+1)) edges. We also prove that the problem of deciding whether a given geometric graph contains a t-spanner with at most K edges is NP-hard. Previously, this NP-hardness result was only known for non-geometric graphs