Sciweavers

188 search results - page 1 / 38
» Pointed Drawings of Planar Graphs
Sort
View
APVIS
2007
14 years 11 months ago
Straight-line grid drawings of planar graphs with linear area
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segm...
Md. Rezaul Karim, Md. Saidur Rahman
DCG
2010
135views more  DCG 2010»
14 years 9 months ago
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices
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...
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, St...
GD
2007
Springer
15 years 3 months ago
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
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 ...
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, St...
CCCG
2007
14 years 11 months ago
Pointed Drawings of Planar Graphs
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
Oswin Aichholzer, Günter Rote, André S...
GD
1997
Springer
15 years 1 months ago
Area Requirements for Drawing Hierarchically Planar Graphs
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...
Xuemin Lin, Peter Eades