Results 21 to 30 of about 737 (123)
Skeletal‐Driven Animation of Anatomical Humans via Neural Deformation Gradients
Computer Graphics Forum, EarlyView.Abstract Most real‐time animation techniques for digital humans are limited to deforming the outer skin surface. Geometric skinning methods are highly efficient but struggle with artifacts such as collapsing joints or self‐intersections when animating inner anatomy along with the outer skin.
G. Nolte +3 more
wiley +1 more source
Register‐Efficient Linear‐Time Evaluation in the Bernstein Basis
Computer Graphics Forum, EarlyView.Abstract We investigate the evaluation of points and derivatives of Bézier curves and surfaces on modern architectures, focusing on performance and guided by numerical error bounds. While the de Casteljau algorithm remains the reference for numerical robustness, its linear working‐set size imposes substantial register pressure on GPUs.
Gábor Valasek, Anna Lili Horváth
wiley +1 more source
NAADF: Globally Illuminated Voxel Worlds Accelerated with Nested Axis‐Aligned Distance Fields
Computer Graphics Forum, EarlyView.Abstract Achieving realistic rendering of 3D scenes in real time using path tracing is challenging due to the high sample count required, with ray tracing as the bottleneck. Focusing on voxels as a geometry representation offers significant opportunities for optimizations, especially for tracing the rays, but also for computing the samples.
A. Ulschmid +4 more
wiley +1 more source
Computer Graphics Forum, EarlyView.Abstract We introduce mixed super‐circles, a position‐curvature formulation of the original dynamic 2D super‐helix model. Compared to the latter, purely curvature‐based model – the so‐called chained formulation –, the mixed formulation that we propose here drastically reduces the algorithmic complexity of the solving scheme – from quadratic to quasi ...
Emile Hohnadel +2 more
wiley +1 more source
Embedding Optimization of Layouts via Distortion Minimization
Computer Graphics Forum, EarlyView.Abstract Given an embedding of a layout in the surface of a target mesh, we consider the problem of optimizing the embedding geometrically. Layout embeddings partition the surface into multiple disk‐like patches, making them particularly useful for parametrization and remeshing tasks, such as quad‐remeshing, since these problems can then be solved on ...
A. Heuschling, I. Lim, L. Kobbelt
wiley +1 more source
Parallel Vectors Extraction using Bézier Clipping
Computer Graphics Forum, EarlyView.Abstract In this paper, we propose a novel local feature extraction algorithm for the parallel vectors (PV) operator. Our method is based on Bézier clipping, which is a bracketing‐based root finding method that is commonly‐used in computer‐aided geometric design.
Nico Daßler, Tobias Günther
wiley +1 more source
The Story(line) So Far: A Survey on Storyline Visualization
Computer Graphics Forum, EarlyView.Abstract Storyline visualizations model narratives as temporal networks, using x‐monotone lines to represent entities and their interactions over time. This technique offers an intuitive way to reveal structural patterns over time, such as character co‐occurrence and narrative flow.
S. Di Bartolomeo +4 more
wiley +1 more source
Hunting Structural Demons in Digital Reticular Chemistry: Lessons From Metal‐Organic Frameworks
Israel Journal of Chemistry, Volume 66, Issue 4, July 2026.Digital reticular chemistry is haunted by “structural demons”, chemically invalid models lurking within massive experimental and hypothetical MOF databases. This mini‐review tracks where these anomalies enter the data pipeline, evaluate the modern computational arsenal used to detect them (from rule‐based algorithms to machine‐learning classifiers ...
Yongchul G. Chung, Myoung Soo Lah
wiley +1 more source
String topology via the coHochschild complex and local intersections
Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.Abstract We construct an algebraic model for the Chas–Sullivan product and the Goresky–Hingston coproduct in string topology. The construction takes as its initial input a simplicial complex equipped with a local pairing on its simplicial chains, for instance, a homology manifold with its local intersection pairing.
Manuel Rivera, Alex Takeda
wiley +1 more source
Barycentric coordinate neighbourhoods in Riemannian manifolds
CoRR, 2016 We quantify conditions that ensure that a signed measure on a Riemannian manifold has a well defined centre of mass. We then use this result to quantify the extent of a neighbourhood on which the Riemannian barycentric coordinates of a set of $n+1$ points on an $n$-manifold provide a true coordinate chart, i.e., the barycentric coordinates provide a ...
Ramsay Dyer +2 more
openaire +2 more sources