Planar Embeddings of Graphs with Specified Edge Lengths

Cabello, Sergio and Demaine, Erik D. and Rote, Günter (2004) Planar Embeddings of Graphs with Specified Edge Lengths. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003 , pp. 283-294(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_26).

Full text not available from this repository.

Abstract

We consider the problem of finding a planar embedding of a (planar) graph with a prescribed Euclidean length on every edge. There has been substantial previous work on the problem without the planarity restrictions, which has close connections to rigidity theory, and where it is easy to see that the problem is NP-hard. In contrast, we show that the problem is tractable—indeed, solvable in linear time on a real RAM—for planar embeddings of planar 3-connected triangulations, even if the outer face is not a triangle. This result is essentially tight: the problem becomes NP-hard if we consider instead planar embeddings of planar 3-connected infinitesimally rigid graphs, a natural relaxation of triangulations in this context.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-24595-7_26
Classifications: G Algorithms and Complexity > G.490 Embeddings
G Algorithms and Complexity > G.070 Area / Edge Length
URI: http://gdea.informatik.uni-koeln.de/id/eprint/458

Actions (login required)

View Item View Item