Results 91 to 100 of about 20,236 (296)
, 1999 Given an undirected graph, the planarity testing problem is to determine whether the graph can be drawn in a plane without any crossing edges. Linear time planarity testing algorithms have previously been designed by Hopcroft and Tarjan, and by Booth and
Shih Wei-Kuan +3 more
core +1 more source
Tailoring Functional Properties of Ti–Ni–Cu Shape Memory Alloy Thin Films for MEMS Actuators
Advanced Engineering Materials, EarlyView.A comprehensive study of critical parameters required to develop well‐performing Ti–Ni–Cu thin film shape memory alloy microactuators is provided. Materials science and device integration aspects are integrated by addressing structural and physical relationships using complementary characterization techniques as well as a practical fabrication solution
Elaheh Akbarnejad +6 more
wiley +1 more source
Incremental Convex Planarity Testing [PDF]
, 2001 An important class of planar straight-line drawings of graphs are convex drawings, in which all the faces are drawn as convex polygons. A planar graph is said to be convex planar if it admits a convex drawing. We give a new combinatorial characterization
Vismara, Luca +2 more
core +1 more source
Geometric Optimization and Structural Analysis of Cable-Braced Gridshells on Freeform Surfaces
BuildingsIn freeform surface grid structures, quadrilateral meshes offer high visual transparency and simple joint connections, but their structural stability is relatively limited.
Xinye Li, Qilin Zhang
doaj +1 more source
Parameterized Complexity of 1-Planarity
Journal of Graph Algorithms and Applications, 2018 We consider the problem of drawing graphs with at most one crossing per edge. These drawings, and the graphs that can be drawn in this way, are called $1$-planar.
Michael Bannister +2 more
doaj +1 more source
Creep Properties and Deformation Mechanism of Additively Manufactured NiAl‐CrMo Composites
Advanced Engineering Materials, EarlyView.Additively manufactured NiAl‐CrMo composites contain numerous interfaces and cell boundaries that control their creep response. At 700°C under high applied stress, creep is dominated by dislocation‐controlled power‐law mechanisms. At 800°C–900°C and lower stresses, creep is primarily diffusion‐controlled along cell boundaries.
Jan Vollhüter +9 more
wiley +1 more source
The Complexity of Planarity Testing [PDF]
, 2003 We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely conjectured that L = SL [Sak96]. The upper bound of SL matches the lower
Allender, Eric +3 more
core +1 more source
Unit-length Rectangular Drawings of Graphs
Journal of Graph Algorithms and ApplicationsA rectangular drawing of a planar graph $G$ is a planar drawing of $G$ in which vertices are mapped to grid points, edges are mapped to horizontal and vertical straight-line segments, and faces are drawn as rectangles.
Carlos Alegría +5 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.Reproduction of stacking fault energy calculations from literature with a semi‐automated large language model‐assisted extraction procedure: extraction of simulation protocol, atomistic structures, computational parameters, and reported results, ontology alignment, knowledge graph construction and, finally, recomputation forvalidation.
Sepideh Baghaee Ravari +5 more
wiley +1 more source
Clustered Planarity with Pipes [PDF]
, 2019 We study the version of the C-Planarity problem in which edges connecting the same pair of clusters must be grouped into pipes, which generalizes the Strip Planarity problem. We give algorithms to decide several families of instances for the two variants
Angelini, Patrizio, Da Lozzo, Giordano
core +1 more source