91 search results - page 18 / 19 » Two-Layer Planarization in Graph Drawing |
115
click to vote
CCCG
2009
15 years 24 days ago
2009
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
JCT
2007
14 years 11 months ago
2007
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
101
click to vote
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...
123
click to vote
COMGEO
2006
ACM
14 years 11 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
GD
2007
Springer
15 years 5 months ago
2007
Springer
A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets γ : V1 → V2 is a pair of planar straightline drawi...