Results 121 to 130 of about 1,651,918 (300)
Planar and poly-arc Lombardi drawings
Journal of Computational Geometry, 2018 In Lombardi drawings of graphs, edges are represented as circular arcs and the edges incident on vertices have perfect angular resolution. It is known that not every planar graph has a planar Lombardi drawing.
Christian A. Duncan +5 more
doaj +1 more source
Map Generalization as a Graph Drawing Problem
, 1995 A map may be regarded as a plane graph drawing; and, with the growth of the field of computer cartography, a map is increasingly treated as a straight-line plane graph drawing.
Alan Saalfeld, Saalfeld, Alan
core +1 more source
Fully Dynamic 3-Dimensional Orthogonal Graph Drawing [PDF]
, 1999 In a 3-dimensional orthogonal drawing of a graph, vertices are mapped to grid points on an integer lattice and edges are routed along integer grid lines.
Johansen, John +7 more
core +1 more source
Energetic Offset in Organic Solar Cells‐ Importance, Confusion and Outlook
Advanced Materials, EarlyView.Energetic offsets in organic solar cells (OSCs) remain a subject of debate due to measurement‐ and lab‐dependent discrepancies. This Perspective clarifies the physical origins of these variations and identifies temperature‐dependent electro‐optical methods as a reliable approach to obtain consistent offset values.
Nakul Jain +5 more
wiley +1 more source
Progress on Partial Edge Drawings
Journal of Graph Algorithms and Applications, 2017 Recently, a new way of avoiding crossings in straight-line drawings of non-planar graphs has been introduced. The idea of partial edge drawings (PED) is to drop the middle part of edges and rely on the remaining edge parts called stubs.
Till Bruckdorfer +6 more
doaj +1 more source
A Graph Drawing and Translation Service on the WWW
, 1997 Both practitioners and researchers can take better advantage of the latest developments in graph drawing if implementations of graph drawing algorithms are made avalable on the WWW.
Bridgeman, Stina +2 more
core +1 more source
Dynamic Euler Diagram Drawing [PDF]
, 2004 In this paper we describe a method to lay out a graph enhanced Euler diagram so that it looks similar to a previously drawn graph enhanced Euler diagram. This task is non-trivial when the underlying structures of the diagrams differ.
Rodgers, Peter +2 more
core +1 more source
Advanced Materials, EarlyView.A Nb‐proximitized Josephson junction based on a WTe2/α‐Fe2O3 heterostructure exhibits a robust superconducting diode effect with programmable polarity. The diode direction can be trained by magnetic fields and switched by temperature cycling, revealing tunable finite‐momentum pairing states and competing superconducting states in symmetry‐broken ...
Enze Zhang +9 more
wiley +1 more source
Colorability in Orthogonal Graph Drawing
, 2008 This paper studies the question: What is the maximum integer k_b,n such that every k_b,n-colorable graph has a b-bend n-dimensional orthogonal box drawing?
Stola, Jan
core +1 more source
Using Games to Investigate Movement for Graph Comprehension [PDF]
, 2004 We describe the results of empirical investigations that explore the effectiveness of moving graph diagrams to improve the comprehension of their structure.
Bovey, John D. +5 more
core +1 more source