Results 181 to 190 of about 2,825 (206)
Analyzing gait data measured by wearable cyborg hybrid assistive limb during assisted walking: gait pattern clustering. [PDF]
Front Med TechnolNamikawa Y +3 more
europepmc +1 more source
Density of straight-line 1-planar graph drawings
Information Processing Letters, 2013 A 1-planar drawing of a graph is such that each edge is crossed at most once. In 1997, Pach and Toth showed that any 1-planar drawing with n vertices has at most 4n-8 edges and that this bound is tight for n>=12. We show that, in fact, 1-planar drawings with n vertices have at most 4n-9 edges, if we require that the edges are straight-line segments. We
Walter Didimo
openalex +3 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
An Algorithm for Straight-Line Drawing of Planar Graphs
Algorithmica, 1998 We present a new algorithm for drawing planar graphs on the plane. It can be viewed as a generalization of the algorithm of Chrobak and Payne, which in turn, is based on an algorithm by de Fraysseix, Pach and Pollack. Our algorithm improves the previous ones in that it does not require a preliminary triangulation step; triangulation proves problematic ...
David Harel, Meir Sardas
openalex +3 more sources
Straight-line realization of planar graphs.
, 1971 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. This leads us to try some practical methods
Luang-hung Shiau
openalex +3 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 +3 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 +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 +3 more sources
On simultaneous straight-line grid embedding of a planar graph and its dual
Information Processing Letters, 2006 Simultaneous representations of planar graphs and their duals normally require that the dual vertices to be placed inside their corresponding primal faces, and the edges of the dual graph to cross only their corresponding primal edges. Erten and Kobourov [C. Erten, S.G. Kobourov, Simultaneous embedding of a planar graph and its dual on the grid, Theory
Huaming Zhang, Xin He
openalex +3 more sources