Oriented Spanners

by   Kevin Buchin, et al.

Given a point set P in the Euclidean plane and a parameter t, we define an oriented t-spanner as an oriented subgraph of the complete bi-directed graph such that for every pair of points, the shortest cycle in G through those points is at most a factor t longer than the shortest oriented cycle in the complete bi-directed graph. We investigate the problem of computing sparse graphs with small oriented dilation. As we can show that minimising oriented dilation for a given number of edges is NP-hard in the plane, we first consider one-dimensional point sets. While obtaining a 1-spanner in this setting is straightforward, already for five points such a spanner has no plane embedding with the leftmost and rightmost point on the outer face. This leads to restricting to oriented graphs with a one-page book embedding on the one-dimensional point set. For this case we present a dynamic program to compute the graph of minimum oriented dilation that runs in O(n^8) time for n points, and a greedy algorithm that computes a 5-spanner in O(nlog n) time. Expanding these results finally gives us a result for two-dimensional point sets: we prove that for convex point sets the greedy triangulation results in an oriented O(1)-spanner.


page 1

page 2

page 3

page 4


Geometric Embedding of Path and Cycle Graphs in Pseudo-convex Polygons

Given a graph G with n vertices and a set S of n points in the p...

Shortest directed networks in the plane

Given a set of sources and a set of sinks as points in the Euclidean pla...

Extraction of cylinders and cones from minimal point sets

We propose new algebraic methods for extracting cylinders and cones from...

On the Shortest Separating Cycle

According to a result of Arkin  (2016), given n point pairs in the plane...

Even Circuits in Oriented Matroids

In this paper we generalise the even directed cycle problem, which asks ...

On beta-Plurality Points in Spatial Voting Games

Let V be a set of n points in ℝ^d, called voters. A point p∈ℝ^d is a plu...

Sweeps, polytopes, oriented matroids, and allowable graphs of permutations

A sweep of a point configuration is any ordered partition induced by a l...

Please sign up or login with your details

Forgot password? Click here to reset