Demo Data from SIGIR 2026 / reviewers in the wild / expert
Hiroaki Tabuchi
dblp:08/3347
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
1 paper |
Computer animation and physical simulation · 87% Virtual and augmented reality · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer animation and physical simulation
deformable body simulation |
0.1 | 1 | 2009 | An edge-based computationally efficient formulation of Saint Venant-Kirchhoff tetrahedral finite elements · ACM Trans. Graph. 2009 |
Computer animation and physical simulation
finite element method |
0.1 | 1 | 2009 | An edge-based computationally efficient formulation of Saint Venant-Kirchhoff tetrahedral finite elements · ACM Trans. Graph. 2009 |
Virtual and augmented reality › haptics
haptic interaction |
0.0 | 1 | 2009 | An edge-based computationally efficient formulation of Saint Venant-Kirchhoff tetrahedral finite elements · ACM Trans. Graph. 2009 |
Methods — techniques the papers use, named apart from their topics
preconditioned conjugate gradient · 0.1implicit integration · 0.1edge-based formulation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | An edge-based computationally efficient formulation of Saint Venant-Kirchhoff tetrahedral finite elementsabstractThis article describes a computationally efficient formulation and an algorithm for tetrahedral finite-element simulation of elastic objects subject to Saint Venant-Kirchhoff (StVK) material law. The number of floating point operations required by the algorithm is in the range of 15% to 27% for computing the vertex forces from a given set of vertex positions, and 27% to 38% for the tangent stiffness matrix, in comparison to a well-optimized algorithm directly derived from the conventional Total Lagrangian formulation. In the new algorithm, the data is associated with edges and tetrahedron-sharing edge-pairs (TSEPs), as opposed to tetrahedra, to avoid redundant computation. Another characteristic of the presented formulation is that it reduces to that of a spring-network model by simply ignoring all the TSEPs. The technique is demonstrated through an interactive application involving haptic interaction, being combined with a linearized implicit integration technique employing a preconditioned conjugate gradient method. Ryo Kikuuwe, Hiroaki Tabuchi, Motoji Yamamoto |
ACM Trans. Graph. | 2 |