Results 121 to 130 of about 264 (216)

LeafFit: Plant Assets Creation from 3D Gaussian Splatting

Computer Graphics Forum, EarlyView.
Abstract We propose LeafFit, a pipeline that converts 3D Gaussian Splatting (3DGS) of individual plants into editable, instanced mesh assets. While 3DGS faithfully captures complex foliage, its high memory footprint and lack of mesh topology make it incompatible with traditional game production workflows. We address this by leveraging the repetition of
Chang Luo, Nobuyuki Umetani
wiley   +1 more source

VQ‐Style: Disentangling Style and Content in Motion with Residual Quantized Representations

Computer Graphics Forum, EarlyView.
Abstract Human motion data is inherently rich and complex, containing both semantic content and subtle stylistic features that are challenging to model. We propose a novel method for effective disentanglement of the style and content in human motion data to facilitate style transfer.
Fatemeh Zargarbashi, Dhruv Agrawal, Jakob Buhmann, Martin Guay, Stelian Coros, Robert W. Sumner   +5 more
wiley   +1 more source

Survey on differential estimators for 3d point clouds

Computer Graphics Forum, EarlyView.
Abstract Recent advancements in 3D scanning technologies, including LiDAR and photogrammetry, have enabled the precise digital replication of real‐world objects. These methods are widely used in fields such as GIS, robotics, and cultural heritage. However, the point clouds generated by such scans are often noisy and unstructured, posing challenges for ...
Léo Arnal–Anger, Thibault Lejemble, David Coeurjolly, Loïc Barthe, Nicolas Mellado   +4 more
wiley   +1 more source

Non‐Rigid 3D Shape Correspondences: From Foundations to Open Challenges and Opportunities

Computer Graphics Forum, EarlyView.
Abstract Estimating correspondences between deformed shape instances is a long‐standing problem in computer graphics; numerous applications, from texture transfer to statistical modelling, rely on recovering an accurate correspondence map. Many methods have thus been proposed to tackle this challenging problem from varying perspectives, depending on ...
A. Zhuravlev, L. Bastian, D. Cao, N. El Amrani, P. Roetzer, V. Ehm, R. Marin, H. Nishizawa, S. Morishima, C. Theobalt, N. Navab, D. Cremers, F. Bernard, Z. Lähner, V. Golyanik   +14 more
wiley   +1 more source

Establishing Shape Correspondences: A Survey

Computer Graphics Forum, EarlyView.
Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
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

CANRIG: Cross‐Attention Neural Face Rigging with Variable Local Control

Computer Graphics Forum, EarlyView.
Abstract Facial animation is one of the most labor‐intensive aspects of animation and VFX, as traditional rigging consumes weeks of expert time and forces animators to spend countless hours manipulating hundreds of controls to achieve varied expressions.
Arad Mohammadi, Sebastian Weiss, Jakob Buhmann, Loic Ciccone, Robert W. Sumner, Derek Bradley, Martin Guay   +6 more
wiley   +1 more source

On the closed geodesics problem

Let $\bk $ be a field of characteristic $p\geq 0$ and $X$ a simply connected finite CW complex. In this text, we prove that: {\sl if the cohomology algebra $H^*(X;\bk)$ is generated, as an algebra, by at least two linearly independent elements, then the sequence of Betti numbers $ \left( \dim H^n(LX;\bk)\right)_{n\geq 1 }$ grows unbounded.} This ...
openaire   +2 more sources

Differentiable Randers‐Finsler Eikonal Solvers

Computer Graphics Forum, EarlyView.
Abstract Fast and differentiable solvers for anisotropic and asymmetric distance fields are a key primitive in geometry processing, enabling gradient‐based optimization over metrics, drift fields, and downstream objectives that depend on geodesic distances and geodesics.
Barak Gahtan, Jacob Shpund, Alex M. Bronstein   +2 more
wiley   +1 more source

Individualized Pathfinding in Rugged Open Terrains Using Semantic Navigation Meshes

Computer Graphics Forum, EarlyView.
We introduce semantic navigation meshes for complex outdoor terrains, partitioning space into regions with coherent semantic properties like slope or vegetation density. The resulting graphs enable efficient pathfinding with agent‐specific, parameterized cost functions without precomputation, accelerating search while maintaining path quality close to ...
C. Creus, N. Pelechano, O. Argudo
wiley   +1 more source