Results 11 to 20 of about 71,285 (269)
A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs [PDF]
International Symposium Graph Drawing and Network Visualization, 2005 This paper presents a linear time algorithm for constructing maximally symmetric straight-line drawings of biconnected and one-connected planar graphs.
Seok-Hee Hong, Peter Eades
semanticscholar +3 more sources
O( n log log n )-work parallel algorithms for straight-line grid embeddings of planar graphs [PDF]
Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, 1992 Martin Fürer +3 more
semanticscholar +3 more sources
Simultaneous straight-line drawing of a planar graph and its rectangular dual [PDF]
, 2015 A natural way to represent on the plane both a planar graph and its dual is to follow the definition of the dual, thus, to place vertices inside their corresponding primal faces, and to draw the dual edges so that they only cross their corresponding primal edges.
Tamara Mchedlidze
+5 more sources
Straight-line drawings of 1-planar graphs
Computational Geometry, 2023 A graph is 1-planar if it can be drawn in the plane so that each edge is crossed at most once. However, there are 1-planar graphs which do not admit a straight-line 1-planar drawing. We show that every 1-planar graph has a straight-line drawing with a two-coloring of the edges, so that edges of the same color do not cross.
Franz J. Brandenburg
openalex +3 more sources
Straight-line realization of planar graphs.
, 2011 Few theorems are known about planar graphs. For, example, Kuratowski proved that a graph is planar if and only if it has no subgraph homeomorphic to K₅ or K₃,₃. It has remained as a direct criterion for determining whether a graph is planar or not. Powerful as the theorem is, it is not always easy to apply.
Luang-hung Shiau
openalex +2 more sources
Straight line embeddings of cubic planar graphs with integer edge lengths [PDF]
Journal of Graph Theory, 2008 AbstractWe prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length. © 2008 Wiley Periodicals, Inc.
Geelen, Jim, Guo, Anjie, McKinnon, David
openaire +3 more sources
On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area
Journal of Graph Algorithms and Applications, 2009 Summary: 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. It is well known that a planar graph of \(n\) vertices admits a straight-line grid drawing on a grid of area \(O(n^2)\).
Md. Rezaul Karim, Md. Saidur Rahman
openalex +2 more sources
Study of Neural Network Algorithm for Straight-Line Drawings of Planar Graphs [PDF]
, 2014 Graph drawing addresses the problem of finding a layout of a graph that satisfies given aesthetic and understandability objectives. The most important objective in graph drawing is minimization of the number of crossings in the drawing, as the aesthetics and readability of graph drawings depend on the number of edge crossings.
Mohamed A. El-Sayed +2 more
openalex +3 more sources
Augmenting Planar Straight Line Graphs to 2-Edge-Connectivity
International Symposium Graph Drawing and Network Visualization, 2015 We show that every planar straight line graph PSLG with n vertices can be augmented to a 2-edge-connected PSLG with the addition of at most $$\lfloor 4n-4/3\rfloor $$ new edges. This bound is the best possible.
Hugo Alves Akitaya +4 more
openaire +2 more sources
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs [PDF]
Theoretical Computer Science, 2017 15 pages, 7 figures, to appear in the Proceedings of WALCOM ...
Hugo A. Akitaya +5 more
openalex +4 more sources