177 research outputs found
Guest Editor's Foreword (Special Issue with Selected Papers from the 19th International Symposium on Graph Drawing, GD 2011)
This issue of the Journal of Graph Algorithms and Applications is devoted to the nineteenth International Symposium on Graph Drawing, held September 19-21, 2011, in Eindhoven, the Netherlands
Higher order Delaunay triangulations
For a set P of points in the plane, we introduce a class of triangulations that is an
extension of the Delaunay triangulation. Instead of requiring that for each triangle the
circle through its vertices contains no points of P inside, we require that at most k points
are inside the circle. Since there are many different higher-order Delaunay triangulations
for a point set, other useful criteria for triangulations can be incorporated without sacrificing
the well-shapedness too much. Applications include realistic terrain modelling and
mesh generation
Facility location on terrains
Given a terrain defined as a piecewise-linear function with n triangles, and m point sites on it, we
would like to identify the location on the terrain that minimizes the maximum distance to the sites. The
distance is measured as the length of the Euclidean shortest path along the terrain. To simplify the
problem somewhat, we extend the terrain to (the surface of) a polyhedron. To compute the optimum
placement, we compute the furthest-site Voronoi diagram of the sites on the polyhedron. The diagram
has maximum combinatorial complexity Q(mn2), and the algorithm runs in O(mn² log²m log n) time
Finding a minimum stretch of a function
Given a piecewise monotone function f : R ! R and a real value Tmin, we develop an algorithm that finds an interval of length at least Tmin for which the average value of f is minimized. The run-time of the algorithm is linear in the number of monotone pieces of f if certain operations are available in constant time for f. We use this algorithm to solve a basic problem arising in the analysis of trajectories: Finding the most similar subtrajectories of two given trajectories, provided that the duration is at least Tmin. Since the precise solution requires complex operations, we also give a simple (1+")approximation algorithm in which these operations are not needed
Finding long and similar parts of trajectories
A natural time-dependent similarity measure for two trajectories is their average distance at corresponding times. We give algorithms for computing the most similar subtrajectories under this measure, assuming the two trajectories are given as two polygonal, possibly self-intersecting lines. When a minimum duration is specified for the subtrajectories, and they must start at exactly corresponding times in the input trajectories, we give a linear-time algorithm for computing the starting time and duration of the most similar subtrajectories. The algorithm is based on a result of independent interest: We present a linear-time algorithm to find, for a piece-wise monotone function, an interval of at least a given length that has minimum average value. When the two subtrajectories can start at different times in the two input trajectories, it appears difficult to give an exact algorithm for the most similar subtrajectories problem, even if the duration of the desired two subtrajectories is fixed to some length. We show that the problem can be solved approximately, and with a performance guarantee. More precisely, we present (1 + e)-approximation algorithms for computing the most similar subtrajectories of two input trajectories for the case where the duration is specified, and also for the case where only a minimum on the duration is specified
Edges and switches, tunnels and bridges
Edge casing is a well-known method to improve the readability of drawings of non-planar graphs. A cased drawing orders the edges of each edge crossing and interrupts the lower edge in an appropriate neighborhood of the crossing. Certain orders will lead to a more readable drawing than others. We formulate several optimization criteria that try to capture the concept of a "good" cased drawing. Further, we address the algorithmic question of how to turn a given drawing into an optimal cased drawing. For many of the resulting optimization problems, we either find polynomial time algorithms or NP-hardness results
Mapping polygons to the grid with small Hausdorff and Fréchet distance
We show how to represent a simple polygon P by a grid (pixel-based) polygon Q that is simple and whose Hausdorff or Fréchet distance to P is small. For any simple polygon P, a grid polygon exists with constant Hausdorff distance between their boundaries and their interiors. Moreover, we show that with a realistic input assumption we can also realize constant Fréchet distance between the boundaries. We present algorithms accompanying these constructions, heuristics to improve their output while keeping the distance bounds, and experiments to assess the output
- …