Results 101 to 110 of about 22,755 (290)
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
On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
Journal of Graph Algorithms and Applications, 2004 We present new O(n)-time methods for planar embedding and Kuratowski subgraph isolation that were inspired by the Booth-Lueker PQ-tree implementation of the Lempel-Even-Cederbaum vertex addition method.
John Boyer, Wendy Myrvold
doaj +1 more source
Advanced Functional Materials, EarlyView.A systematic review is conducted to assess the influence of electrode architecture across micro‐ to mesoscopic length scales on electron‐transfer pathways in electrocatalysis. We discuss the structure‐activity relationships in electrocatalytic applications, including resource recovery and environmental remediation, and provide cost‐effective, efficient
Manshu Zhao +6 more
wiley +1 more source
Stacked planar optics: an application of the planar microlens
Applied Optics, 1982 In this paper we present a new development of the distributed-index planar microlens of 2.5-3-mm focal length and 0.15 N.A. and also show that it is usable with optical components in fiber communications. We then propose a concept of stacked planar optics consisting of a stack of arrayed planar microlenses and other optical components.
K, Iga +4 more
openaire +2 more sources
, 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
Morphing Planar Graph Drawings with Bent Edges
Journal of Graph Algorithms and Applications, 2011 We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph is polynomial size and discrete: it uses a polynomial number of elementary steps, where each ...
Anna Lubiw, Mark Petrick
doaj +1 more source
Advanced Functional Materials, EarlyView.A Li2O‐rich solid electrolyte interphase (SEI) is engineered on graphite through a propylene carbonate‐based electrolyte to spatially regulate Li plating. The homogeneous interphase lowers Li nucleation barriers, promotes conformal Li deposition around graphite particles, and suppresses dendritic accumulation, enabling durable hybrid Li‐ion/Li‐metal ...
Robert Kuphal +8 more
wiley +1 more source
Discrete Applied Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Valentin E. Brimkov +2 more
openaire +1 more source
Min-$k$-planar Drawings of Graphs
Journal of Graph Algorithms and ApplicationsThe study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing.
Carla Binucci +9 more
doaj +1 more source
Advanced Functional Materials, EarlyView.A dynamically actuated reconfigurable topographical surface (DARTS) integrates contact‐mediated bactericidal nanotopography with programmable mechanical actuation to actively disrupt bacterial biofilms. Dynamic surface reconfiguration enhances bacterial killing and suppresses implant‐associated infections in vivo, providing a new strategy for active ...
Mohammad Asadi Tokmedash +4 more
wiley +1 more source