Results 1 to 10 of about 92,439 (163)
Geometric Thickness of Complete Graphs [PDF]
Journal of Graph Algorithms and Applications, 2000 11 pages, 3 figures. A preliminary version of this paper appeared in the Sixth Symposium on Graph Drawing, GD '98, (Montr\'eal, Canada, August 1998), Springer-Verlag Lecture Notes in Computer Science 1547, 102 ...
Michael Dillencourt +2 more
doaj +5 more sources
On the geometric thickness of 2-degenerate graphs
Journal of Computational Geometry, 2023 A graph is $2$-degenerate if every subgraph contains a vertex of degree at most $2$. We show that every $2$-degenerate graph can be drawn with straight lines such that the drawing decomposes into $4$ plane forests.
Rahul Jain +3 more
doaj +6 more sources
On graph thickness, geometric thickness, and separator theorems [PDF]
Computational Geometry: Theory and Applications, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christian A Duncan
exaly +2 more sources
Applied Sciences, 2021 Industry 4.0 aims to digitalize the manufacturing process to increase the productivity and the product quality of plants. A fundamental aspect of the digitalized manufacturing processes is the simulation of the manufacturing process in order to develop ...
Gillo Giuliano +2 more
doaj +3 more sources
A study of the influence of the base thickness on photoelectric parameters of silicon solar cells with the new TCAD algorithms [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2021 The Sentaurus TCAD software package is widely used in the modeling of semiconductor optoelectronic devices. The main part of simulating solar elements is creating a correct geometric model.
Murodjon K. Abduvohidov +2 more
doaj +1 more source
Geometric thickness of multigraphs is ¿R-Complete
CoRR, 2023 We say that a (multi)graph has geometric thickness t if there exists a straight-line drawing and a t-coloring of its edges where no two edges sharing a point in their relative interior have the same color. The Geometric Thickness problem asks whether a given multigraph has geometric thickness at most t.
Henry Förster +5 more
openaire +5 more sources
Discrete Mathematics & Theoretical Computer Science, 2004 A \emph(k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour classes no two monochromatic edges cross.
Vida Dujmović +2 more
doaj +1 more source
Comprehensive Analysis of Geometric Model of a Variable Thickness Scroll Expander
Shanghai Jiaotong Daxue xuebao, 2023 A novel variable thickness scroll expander composed of involutes of circle with different base circle radii is proposed. The generating method of profile is discussed, the general equation of profile is given, and a series of geometric models of the ...
ZHANG Pengcheng, PENG Bin, MA Jie
doaj +1 more source
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A \emphk-stack layout (respectively, \emphk-queuelayout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering.
Vida Dujmović, David R. Wood
doaj +1 more source
Thickness and Colorability of Geometric Graphs [PDF]
Computational Geometry, 2013 The authors consider the thickness and geometric thickness of graphs. They give an example of a graph with thickness equal to 2 and geometric thickness equal to 3. They prove that the problem of recognizing geometric thickness is NP-hard even for graphs with geometric thickness equal to 2.
Stephane Durocher +2 more
openaire +2 more sources