Results 91 to 100 of about 5,920 (280)

K\"ahler manifolds with geodesic holomorphic gradients

, 2017
A vector field on a Riemannian manifold is called geodesic if its integral curves are reparametrized geodesics. We classify compact K\"ahler manifolds admitting nontrivial real-holomorphic geodesic gradient vector fields that satisfy an additional ...
Derdzinski, Andrzej, Piccione, Paolo
core   +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

Jacobi fields and geodesic spheres

, 1979
SynopsisThis is a contribution to the general problem of determining the extent to which the geometry of a riemannian manifold is determined by properties of its geodesic spheres. In particular we show that total umbilicity of geodesic spheres determines
T. J. Willmore, L. Vanhecke
core   +1 more source

Random perturbation to the geodesic equation [PDF]

, 2016
We study random “perturbation” to the geodesic equation. The geodesic equation is identified with a canonical differential equation on the orthonormal frame bundle driven by a horizontal vector field of norm .
Xue-mei Li, Li, X-M.
core   +1 more source

Geodesic fields for Pontryagin type

, 2022
Let M be a differentiable manifold, TxM be its tangent space at x ∈ M and TM = {(x, y);x ∈ M;y ∈ TxM} be its tangent bundle. A C0-Finsler structure is a continuous function F : TM → [0, ∞) such that F(x, ⋅) : TxM → [0, ∞) is an asymmetric norm.
Hugo Murilo Rodrigues, Ryuichi Fukuoka
core   +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

Characterization of Isoclinic, Transversally Geodesic and Grassmannizable Webs

Axioms
One of the most relevant topics in web theory is linearization. A particular class of linearizable webs is the Grassmannizable web. Akivis gave a characterization of such a web, showing that Grassmannizable webs are equivalent to isoclinic and ...
Jihad Saab, Rafik Absi
doaj   +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