ISSUE 02THURSDAY, JUNE 4, 2026PRINT 06.2026

GEOMDIGEST

THE INSIDER PUBLICATION FOR COMPUTATIONAL GEOMETRY & DESIGN

GEOMDIGEST / PAPERS / ROBUST-BIHARMONIC-SKINNING-USING-GEOMETRIC-FIELDS-2025-614656
No code

Robust Biharmonic Skinning Using Geometric Fields

2025 / ACM Transactions on Graphics / DOI 10.1145/3771928

Bounded bihramonic weights are a popular tool used to rig and deform characters for animation, to compute reduced-order simulations, and to define feature descriptors for geometry processing. They necessitate tetrahedralizing the volume bounded by the surface, introducing the possibility of meshing artifacts or tetrahedralization failure. We introduce a mesh-free and robust automatic skinning technique that generates weights comparable to the current state of the art, but works reliably even on open surfaces, triangle soups, and point clouds where current methods fail. We achieve this through the use of a specialized Lagrangian representation enabled by the advent of hardware ray-tracing, which circumvents the need for finite elements while optimizing the biharmonic energy and enforcing boundary conditions. The flexibility of our formulation allows us to integrate artistic control through weight painting during the optimization. We offer a thorough qualitative and quantitative evaluation of our method.

0
Citations
44
References
0
Implementations
No evidence
Repro status

Reproducibility Dossier

No evidenceConfidence: automated / checked Apr 2026

GEOMDIGEST treats reproducibility as an evidence trail: public artifacts, documentation, data, packaging, archival stability, and verification checks. Numeric scores are only exposed for audited records; public pages prioritize the evidence itself.

0
Evidence
0
Verified
not yet
Code
not yet
Data
not yet
Docs
not yet
Build checks
No public reproducibility evidence has been attached yet. Editors can add code, data, documentation, package, demo, benchmark, archive, or supplement links.
Methodology
Improve this dossier

Implementation Index

No implementations indexed yet

This paper is in the knowledge graph, but we have not attached a runnable artifact yet.