Results 111 to 120 of about 1,651,918 (300)
Pragmatic Graph Rewriting Modifications [PDF]
, 1999 We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match ...
Rodgers, Peter +3 more
core +1 more source
Advanced Functional Materials, EarlyView.The mantis shrimp telson reveals how ridged biological shields control deformation under impact. Inspired by this architecture, telson‐inspired ridged curved shells transform ridge geometry and macroscopic curvature into bidirectional snap‐through, tunable stiffness, and enhanced hysteretic energy dissipation for multifunctional architected materials ...
Phani Saketh Dasika +5 more
wiley +1 more source
Rook-Drawing for Plane Graphs [PDF]
, 2015 Motivated by visualization of large graphs, we introduce a new type of graph drawing called "rook-drawing". A rook-drawing of a graph G is obtained by placing the n nodes of G on the intersections of a regular grid, such that each row and column of the grid supports exactly one node. This paper focuses on rook-drawings of planar graphs. We first give a
Auber, David +3 more
openaire +3 more sources
Every graph admits an unambiguous bold drawing
Journal of Graph Algorithms and Applications, 2015 Let r and w be fixed positive numbers, w < r. In a bold drawing of a graph, every vertex is represented by a disk of radius r, and every edge by a narrow rectangle of width w.
János Pach
doaj +1 more source
Advanced Healthcare Materials, EarlyView.A polymeric graft loaded with radiopaque bismuth nanoparticles is expected to undergo gradual polymer resorption and nanoparticle release. This design enables noninvasive, multimodal monitoring of device integrity, patency, and degradation using computed tomography alongside ultrasound and photoacoustic imaging over 12 weeks.
Allan John R. Barcena +13 more
wiley +1 more source
Morphing Planar Graphs in Spherical Space
Journal of Graph Algorithms and Applications, 2008 We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continuous and intersection-free morph between two sphere drawings of a maximally
Stephen Kobourov, Matthew Landis
doaj +1 more source
Connectivity-Faithful Graph Drawing [PDF]
Connectivity is one of the important fundamental structural properties of graphs, and a graph drawing D should faithfully represent the connectivity structure of the underlying graph G.
Jing, Yongcheng +2 more
core +1 more source
Bioinspired Adaptive Sensors: A Review on Current Developments in Theory and Application
Advanced Materials, EarlyView.This review comprehensively summarizes the recent progress in the design and fabrication of sensory‐adaptation‐inspired devices and highlights their valuable applications in electronic skin, wearable electronics, and machine vision. The existing challenges and future directions are addressed in aspects such as device performance optimization ...
Guodong Gong +12 more
wiley +1 more source
Non-aligned Drawings of Planar Graphs
Journal of Graph Algorithms and Applications, 2017 A non-aligned drawing of a graph is a drawing where no two vertices are in the same row or column. Auber et al. showed that not all planar graphs have a non-aligned planar straight-line drawing in the $n\times n$-grid.
Therese Biedl, Claire Pennarun
doaj +1 more source
Advanced Materials, EarlyView.Metal‐free carbon catalysts enable the sustainable synthesis of hydrogen peroxide via two‐electron oxygen reduction; however, active site complexity continues to hinder reliable interpretation. This review critiques correlation‐based approaches and highlights the importance of orthogonal experimental designs, standardized catalyst passports ...
Dayu Zhu +3 more
wiley +1 more source