Results 81 to 90 of about 22,687 (289)
Multilayer Self‐Limiting Electrospray Deposition via Stepped Voltage Bias
Advanced Engineering Materials, EarlyView.Self‐limiting electrospray deposition (SLED) uses a high voltage to generate and deposit a charged payload on a target surface. The coating retains its charge, repelling newly arriving material. SLED thickness can be decreased by applying a secondary bias to the target.
Madhuri Deb +3 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.Residual adhesive after electrode loading in adhesive‐assisted resistance spot welding is quantified through a traceable experimental‐to‐digital workflow. Chromatic confocal topography provides calibrated surface‐height data, while OpenCV detects the electrode imprint and integrates adhesive height into comparable volume metrics.
Sung‐Min Wi, Jiangdong Zhao
wiley +1 more source
The Electronic Journal of Combinatorics, 2019 We say that a graph $H$ is planar unavoidable if there is a planar graph $G$ such that any red/blue coloring of the edges of $G$ contains a monochromatic copy of $H$, otherwise we say that $H$ is planar avoidable. That is, $H$ is planar unavoidable if there is a Ramsey graph for $H$ that is planar. It follows from the Four-Color Theorem and a result of
Axenovich, M. +3 more
openaire +6 more sources
Additional PC-Tree Planarity Conditions
, 2004 Recent research efforts have produced new algorithms for solving planarity-related problems. One such method performs vertex addition using the PC-tree data structure, which is similar to but simpler than the well-known PQ-tree.
Boyer, John M., John M. Boyer
core +1 more source
Clustered Planarity with Pipes [PDF]
, 2016 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
1-Planarity of Graphs with a Rotation System
Journal of Graph Algorithms and Applications, 2015 A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. 1-planarity is known NP-hard, even for graphs of bounded bandwidth, pathwidth, or treewidth, and for near-planar graphs in which an edge is added to a planar
Christopher Auer +3 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.CT‐based finite element simulations combined with in situ X‐ray computed tomography are used to analyze insert pull‐out in nickel‐coated polymer foams. Despite variations in material parameters, deformation consistently concentrates within a narrow annular region around the insert.
Yannik Bautz +4 more
wiley +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
Fabrication Routes for Ionic Conducting Fiber Strain Sensors
Advanced Engineering Materials, EarlyView.Ionic conducting fiber strain sensors (ICFSs) offer compliant, textile‐integrable sensing. Thus far, the commercialization of ICFSs has been constrained by fiber fabrication routes. This review provides a fabrication‐centric analysis of ICFSs correlating processing strategies with material properties and scalability.
Leo John Kershaw +3 more
wiley +1 more source
, 2004 Planarity is an important concept in graph drawing. It is generally accepted that planar drawings are well understandable. Recently, several variations of planarity have been studied for advanced graph concepts such as k-level graphs and clustered graphs.
Michael Forster, Christian Bachmaier
core +1 more source