Results 21 to 30 of about 1,028,122 (138)
On RAC Drawings of Graphs with Two Bends per Edge
Journal of Graph Algorithms and ApplicationsIt is shown that every $n$-vertex graph that admits a 2-bend RAC drawing in the plane, where the edges are polylines with two bends per edge and any pair of edges can only cross at a right angle, has at most $20n-24$ edges for $n\geq 3$.
Csaba Tóth
doaj +1 more source
Structural Concrete, EarlyView.Abstract Several test methods have been proposed in the literature for measuring the level of residual prestress, most of them involving either semi‐ or fully destructive techniques for local measurements which could be highly sensitive to boundary conditions and execution details.
Giuseppe Zarrella +2 more
wiley +1 more source
Simplification of Polyline Bundles [PDF]
, 2020 We propose and study a generalization to the well-known problem of polyline simplification. Instead of a single polyline, we are given a set of l polylines possibly sharing some line segments and bend points.
Zink, Johannes +2 more
core +1 more source
Computing Skinning Weights via Convex Duality
Computer Graphics Forum, EarlyView.We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley +1 more source
Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs
Journal of Graph Algorithms and ApplicationsIn a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline and edge crossings must occur at an angle of exactly $90^\circ$, where the number of bends on such polylines is typically restricted in some way.
Cornelius Brand +3 more
doaj +1 more source
3D Character Reconstruction from Hand‐drawn Model Sheets
Computer Graphics Forum, EarlyView.Abstract Hand‐drawn model sheets are widely used in character design to define 3D shape and appearance through sparse multi‐view drawings. Reconstructing 3D characters from such sparse inputs has traditionally been challenging due to insufficient visual information.
Hyejeong Yoon +3 more
wiley +1 more source
Real‐Time Rendering of Dynamic Line Sets using Voxel Ray Tracing
Computer Graphics Forum, EarlyView.Abstract Real‐time rendering of dynamic line sets is relevant in many visualization tasks, including unsteady flow visualization and interactive white matter reconstruction from Magnetic Resonance Imaging. High‐quality global illumination and transparency are important for conveying the spatial structure of dense line sets, yet remain difficult to ...
B. Kraaijeveld +3 more
wiley +1 more source
On Upward-Planar L-Drawings of Graphs
Journal of Graph Algorithms and ApplicationsIn an upward-planar L-drawing of a directed acyclic graph (DAG) each edge $e=(v,w)$ is represented as a polyline composed of a vertical segment with its lowest endpoint at the tail $v$ of $e$ and of a horizontal segment ending at the head $w$ of $e ...
Patrizio Angelini +3 more
doaj +1 more source
Layer3D: A 3D Layered Representation for Multiview Vector Graphics
Computer Graphics Forum, EarlyView.Abstract We present Layer3D, a novel 3D neural representation that models objects as collections of decomposable neural implicit primitives. These primitives enable the generation of layered images with consistent correspondences across viewpoints, establishing a flexible framework for multiview vector graphics decomposition.
Zhongyue Guan, Yixin Hu, Zeyu Wang
wiley +1 more source
Planar Polyline Drawings with Good Angular Resolution
, 1998 We present a linear time algorithm that constructs a planar polyline grid drawing of any plane graph with n vertices and maximum degree d on a (2n-5) \times (3n/2-7/2) grid with at most 5n-15 bends and minimum angle >2/d.
Gutwenger, Carsten +5 more
core +1 more source