Results 311 to 314 of about 543,681 (314)
Some of the next articles are maybe not open access.

Drawing Graphs in the Plane with High Resolution

SIAM Journal on Computing, 1993
The problem of drawing a graph in the plane so that edges appear as straight lines and the minimum angle formed by any pair of incident edges is maximized is studied. The resolution of a layout is defined to be the size of the minimum angle formed by incident edges of the graph, and the resolution of a graph is defined to be the maximum resolution of ...
Formann, M.   +7 more
openaire   +4 more sources

Planar and Plane Graphs

1992
Planar graphs have many important applications in computer science, for example in VLSI layout. Many problems that are hard or even NP-complete for arbitrary graphs are much easier for planar graphs. In the next lecture we will prove a nice result due to Lipton and Tarjan in 1977 [73] which opens up planar graphs to divide-and-conquer.
openaire   +2 more sources

Drawing Plane Graphs

2003
Automatic aesthetic drawing of plane graphs has recently created intense interest due to its broad applications, and as a consequence, a number of drawing methods, such as the straight line drawing, convex drawing, orthogonal drawing, rectangular drawing and box-rectangular drawing, have come out [8,9,3,4,5,6,7, 10,11,14,16,23,29,33].
openaire   +2 more sources

On partitioning a plane graph by plane curves

2012
Glantz, Roland, Meyerhenke, Henning
openaire   +1 more source

Home - About - Disclaimer - Privacy