Results 11 to 20 of about 28,541 (252)
On Collinear Sets in Straight-Line Drawings [PDF]
, 2011 Several small amendments; 21 pages, 11 ...
Alexander Ravsky, Oleg Verbitsky 0001
openaire +2 more sources
Journal of Graph Algorithms and Applications, 2017 We introduce a new type of graph drawing called "rook-drawing". A rook-drawing of a graph $G$ is obtained by placing the $n$ nodes of $G$ on the intersections of a regular grid, such that each row and column of the grid supports exactly one node.
David Auber +3 more
doaj +1 more source
Non-aligned Drawings of Planar Graphs
Journal of Graph Algorithms and Applications, 2017 A non-aligned drawing of a graph is a drawing where no two vertices are in the same row or column. Auber et al. showed that not all planar graphs have a non-aligned planar straight-line drawing in the $n\times n$-grid.
Therese Biedl, Claire Pennarun
doaj +1 more source
Orthogonal-Ordering Constraints are Tough
Journal of Graph Algorithms and Applications, 2013 We show that rectilinear graph drawing, the core problem of bend-minimum orthogonal graph drawing, and uniform edge-length drawing, the core problem of force-directed placement, are NP-hard even for embedded paths if subjected to orthogonal ...
Ulrik Brandes, Barbara Pampel
doaj +1 more source
Minimum-Area Drawings of Plane 3-Trees
Journal of Graph Algorithms and Applications, 2011 A straight-line grid drawing of a plane graph G is a planar drawing of G, where each vertex is drawn at a grid point of an integer grid and each edge is drawn as a straight-line segment.
Debajyoti Mondal +3 more
doaj +1 more source
A Note on Minimum-Segment Drawings of Planar Graphs
Journal of Graph Algorithms and Applications, 2013 A straight-line drawing of a planar graph G is a planar drawing of G such that each vertex is mapped to a point on the Euclidean plane, each edge is drawn as a straight line segment, and no two edges intersect except possibly at a common endpoint ...
Stephane Durocher +3 more
doaj +1 more source
Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n log n) Area
Journal of Graph Algorithms and Applications, 2011 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 segment without edge crossings.
Md. Rezaul Karim +2 more
doaj +1 more source
On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area
Journal of Graph Algorithms and Applications, 2009 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 segment without edge crossings.
Md. Rezaul Karim, Md. Saidur Rahman
doaj +1 more source