Results 181 to 190 of about 3,062 (225)
An Algorithm for Straight-Line Drawing of Planar Graphs
Algorithmica, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Harel, Meir Sardas
openalex +3 more sources
Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs
SIAM Journal on Discrete Mathematics, 1994 This paper presents two optimal linear work algorithms for computing straight-line grid embeddings of planar graphs. Given a combinatorial embedding of the input graph (with \(n\geq 3\) vertices) a straight-line embedding on a grid of size \((n- 2)\times (n- 2)\) can be computed deterministically in \(O(\log n\log\log n)\) time with \(n/\log n\log\log ...
Ming‐Yang Kao +3 more
openalex +3 more sources
Theoretical and practical results on straight skeletons of planar straight-line graphs
Proceedings of the twenty-seventh annual symposium on Computational geometry, 2011 We study straight skeletons and make both theoretical and practical contributions which support new approaches to the computation of straight skeletons of arbitrary planar straight-line graphs (PSLGs). We start with an adequate extension of the concept of motorcycle graphs to PSLGs, with motorcycles starting at the reflex vertices of a PSLG, which ...
Stefan Huber, Martin Held
openalex +2 more sources
Straight-line grid drawings of planar graphs with linear area
2007 6th International Asia-Pacific Symposium on Visualization, 2007 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(n2).
Md Rezaul Karim, Md. Saidur Rahman
openalex +2 more sources
Information Processing Letters, 1998 A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line ...
Jurek Czyzowicz +2 more
openalex +2 more sources
Constrained Tri-Connected Planar Straight Line Graphs
, 2012 It is known that for any set V of n ≥ 4 points in the plane, not in convex position, there is a 3-connected planar straight line graph G = (V, E) with at most 2n − 2 edges, and this bound is the best possible. We show that the upper bound | E | ≤ 2n continues to hold if G = (V, E) is constrained to contain a given graph G 0 = (V, E 0), which is either ...
Marwan Al-Jubeh +5 more
openalex +2 more sources
An algorithm for straight-line representation of simple planar graphs
Journal of the Franklin Institute, 1969 Abstract An algorithm is developed for drawing straight-line planar graphs which are isomorphic to a convex polyhedron and simple (i.e. a connected graph with no self-loops or multiple branches). The construction of such graphs is outlined in three stages.
L. S. Woo
openalex +3 more sources