Results 181 to 190 of about 1,092,292 (254)

See4D: Pose‐Free 4D Generation via Auto‐Regressive Video Inpainting

open access: yesComputer Graphics Forum, EarlyView.
Abstract Immersive applications call for synthesizing spatiotemporal 4D content from casual videos without costly 3D supervision. Existing video‐to‐4D methods typically rely on manually annotated camera poses, which are labor‐intensive and brittle for in‐the‐wild footage.
Dongyue Lu   +10 more
wiley   +1 more source

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

open access: yesComputer 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   +14 more
wiley   +1 more source

Embedding Optimization of Layouts via Distortion Minimization

open access: yesComputer 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

Results on the graceful game and range-relaxed graceful Game on graphs and new variants of labeling games

open access: yes
Given a graph G = (V, E) and a set of consecutive integer labels L = {0, . . . , k}, a vertex labeling of G is a function f : V (G) −→ L that induces an edge labeling g(uv) for every edge uv ∈ E(G).
Oliveira, Deise Lilian de
core  

Beauty in the Eye of AI: Aligning LLMs and Vision Models with Human Aesthetics in Network Visualization

open access: yesComputer Graphics Forum, EarlyView.
Abstract Network visualization has traditionally relied on heuristic metrics, such as stress, under the assumption that optimizing them leads to aesthetic and informative layouts. However, no single metric consistently produces the most effective results.
X. Li, P. Zhang, X. Wang, H. Shen, Y. Hu
wiley   +1 more source

Differentiable Randers‐Finsler Eikonal Solvers

open access: yesComputer 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   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy