9 search results - page 1 / 2 » Simultaneous Graph Embedding with Bends and Circular Arcs |
GD
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial em...
GD
1999
Springer
13 years 9 months ago
1999
Springer
In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the a...
GD
2004
Springer
13 years 10 months ago
2004
Springer
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2 )×O(n2 ) grid, with at most three bends per edge, where n is the number of verti...
GD
2007
Springer
13 years 11 months ago
2007
Springer
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...
WG
2007
Springer
13 years 11 months ago
2007
Springer
A circular-arc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has...