Results 1 to 10 of about 28,541 (252)
The Straight-Line RAC Drawing Problem is NP-Hard [PDF]
Journal of Graph Algorithms and Applications, 2012 A RAC drawing of a graph is a polyline drawing in which every pair of crossing edges intersects at right angle. In this paper, we focus on straight-line RAC drawings and demonstrate an infinite class of graphs with unique RAC combinatorial embedding.
Evmorfia Argyriou +2 more
doaj +3 more sources
On Extending a Partial Straight-Line Drawing [PDF]
Lecture Notes in Computer Science, 2006 We investigate the computational complexity of the following problem. Given a planar graph in which some vertices have already been placed in the plane, place the remaining vertices to form a planar straight-line drawing of the whole graph. We show that this extensibility problem, proposed in the 2003 "Selected Open Problems in Graph Drawing" [1], is ...
Maurizio Patrignani +1 more
exaly +3 more sources
Machines, 2023 In this article, a mathematical model has been developed for calculating the energy-power parameters of the drawing process in monolithic dies on straight-line drawing machines, and its adequacy has been validated in experimental wire drawing on a ...
Liudmila V. Radionova +3 more
doaj +3 more sources
Straight-line drawings of 1-planar graphs
Computational Geometry: Theory and ApplicationsA 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 Brandenburg
exaly +3 more sources
Kinematic characteristics in patients with subcortical vascular cognitive impairment: a quantitative analysis of digitized spiral drawing metrics [PDF]
Scientific ReportsSubcortical vascular cognitive impairment (SVCI) is caused by white matter degeneration. Multiple lacunar infarction due to deep small vascular disease around the subcortical structure and incomplete infarction of white matter owing to decreased ...
Hyo Jeong Kim +4 more
doaj +2 more sources
Area-efficient planar straight-line drawings of outerplanar graphs
Discrete Applied Mathematics, 2007 An outerplanar graph \(G\) with \(n\) vertices and maximal degree \(d\) admits a planar straight-line grid drawing with area \(\mathbf O(dn^{1.48})\) in \(\mathbf O(n)\) time. In case \(d=\mathbf o(n^{0.52})\), \(G\) can be drawn this way in \(\mathbf o(n^2)\) area.
Adrian Rusu
exaly +3 more sources
Transversal structures on triangulations: A combinatorial study and straight-line drawings
Discrete Mathematics, 2009 42 pages, the second version is shorter, focusing on the bijection (with application to counting) and on the graph drawing algorithm.
exaly +3 more sources
Drawing Halin-graphs with small height
Journal of Graph Algorithms and Applications, 2022 In this paper, we study how to draw Halin-graphs, i.e., planar graphs that consist of a tree $T$ and a cycle among the leaves of that tree. Based on tree-drawing algorithms and the pathwidth $pw(T) $, a well-known graph parameter, we find poly-line ...
Therese Biedl, Milap Sheth
doaj +1 more source
Equilateral Spherical Drawings of Planar Cayley Graphs
Journal of Graph Algorithms and Applications, 2021 In this paper, we study equilateral spherical drawings of planar Cayley graphs. We focus on the case when the underlying group is generated by two rotations.
Ming-Hsuan Kang, Wu-Hsiung Lin
doaj +1 more source
Straight-Line Rectangular Drawings of Clustered Graphs [PDF]
Discrete & Computational Geometry, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Patrizio Angelini +2 more
openaire +5 more sources