Results 151 to 160 of about 672,088 (240)
Fast Injective Mesh Parameterization via Beltrami Coefficient Prolongation
Abstract We present a highly efficient and robust method for free boundary injective parameterization of disk‐like triangle meshes with low isometric distortion. Harmonic function–based approaches, grounded in a strong mathematical framework, are widely employed.
G. Fargion, O. Weber
wiley +1 more source
Mesh Processing Non‐Meshes via Neural Displacement Fields
Abstract Mesh processing pipelines are mature, but adapting them to newer non‐mesh surface representations—which enable fast rendering with compact file size—requires costly meshing or transmitting bulky meshes, negating their core benefits for streaming applications.
Yuta Noma +4 more
wiley +1 more source
OUGS: Active View Selection via Object‐aware Uncertainty Estimation in 3DGS
Abstract Recent advances in 3D Gaussian Splatting (3DGS) have achieved state‐of‐the‐art results for novel view synthesis. However, efficiently capturing high‐fidelity reconstructions of specific objects within complex scenes remains a significant challenge.
Haiyi Li +3 more
wiley +1 more source
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley +1 more source
Non‐Rigid 3D Shape Correspondences: From Foundations to Open Challenges and Opportunities
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
Establishing Shape Correspondences: A Survey
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
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
Medial Axis Aware Learning of Signed Distance Functions
Abstract We propose a novel variational method to compute a highly accurate global signed distance function (SDF) to a given point cloud. To this end, the jump set of the gradient of the SDF, which coincides with the medial axis of the surface, is explicitly taken into account through a higher‐order variational formulation that enforces linear growth ...
Samuel Weidemaier +2 more
wiley +1 more source
On Bending in the As‐Rigid‐As‐Possible Deformation Energy
Abstract The well‐established As‐Rigid‐As‐Possible (ARAP) energy has various forms. For surface deformation, commonly used energies contain an implicit bending penalty. We present a natural, continuous generalization that incorporates multiple ARAP versions with an implicit, user‐controllable bending penalty.
Ugo Finnendahl, Marc Alexa
wiley +1 more source
Attention Based Optimization for 3D Shape Registration
Abstract Transformers are sequence‐to‐sequence architectures originally designed to handle structurally rigid and order‐sensitive data, such as text and images. At their core, they exploit the attention mechanism, which is permutation‐equivariant and relies on computing token‐to‐token relationships.
A. Riva, L. Olearo, S. Melzi
wiley +1 more source

