Redrawing a Graph within a Geometric Tolerance

Abellanas, Manuel and Hurtado, Ferran and Ramos, Pedro (1995) Redrawing a Graph within a Geometric Tolerance. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 246-253(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_376).

Full text not available from this repository.

Abstract

In this paper we investigate some applications of the concept of tolerance to graph drawing. Given a geometric structure, the tolerance is a measure of how much the set of points can be arbitrarily changed while preserving the structure. Then, if we have a layout of a graph and we want to redraw the graph while preserving the mental map (captured by some proximility graph of the set of nodes), the tolerance of this proximity graph can be a useful tool. We present an optimal O(n log n) algorithm for computing the tolerance of the Delaunay triangulation of a set of points and propose some variations with applications to interactive environments.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-58950-3_376
Classifications: Z Theory > Z.250 Geometry
G Algorithms and Complexity > G.560 Geometry
P Styles > P.999 Others
URI: http://gdea.informatik.uni-koeln.de/id/eprint/186

Actions (login required)

View Item View Item