Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Maxime Tournier

dblp:45/5984 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 5 · 4 first-authorHuman-computer interaction and ubiquitous computing · 2 · 1 first-author

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 · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer animation and physical simulation › multibody dynamics simulation
constrained dynamics
0.212015
Stable constrained dynamics · ACM Trans. Graph. 2015
Computer animation and physical simulation › deformable body simulation
deformable solid simulation
0.212015
Stable constrained dynamics · ACM Trans. Graph. 2015
Computer animation and physical simulation › deformable body simulation
elasticity simulation
0.212015
Stable constrained dynamics · ACM Trans. Graph. 2015

Methods — techniques the papers use, named apart from their topics

linear solver · 0.2geometric stiffness · 0.2constraint-based simulation · 0.2
YearPublicationVenuePosition
2015 6D frictional contact for rigid bodies
C. Bouchard, Matthieu Nesme, Maxime Tournier, François Faure, Paul G. Kry
Graphics Interface3
2015 Stable constrained dynamics
abstract
We present a unification of the two main approaches to simulate deformable solids, namely elasticity and constraints. Elasticity accurately handles soft to moderately stiff objects, but becomes numerically hard as stiffness increases. Constraints efficiently handle high stiffness, but when integrated in time they can suffer from instabilities in the nullspace directions, generating spurious transverse vibrations when pulling hard on thin inextensible objects or articulated rigid bodies. We show that geometric stiffness, the tensor encoding the change of force directions (as opposed to intensities) in response to a change of positions, is the missing piece between the two approaches. This previously neglected stiffness term is easy to implement and dramatically improves the stability of inextensible objects and articulated chains, without adding artificial bending forces. This allows time step increases up to several orders of magnitude using standard linear solvers.
Maxime Tournier, Matthieu Nesme, Benjamin Gilles, François Faure
ACM Trans. Graph.1
2014 Seamless adaptivity of elastic models
Maxime Tournier, Matthieu Nesme, François Faure, Benjamin Gilles
Graphics Interface1
2014 Velocity-based adaptivity of deformable models
Maxime Tournier, Matthieu Nesme, François Faure, Benjamin Gilles
Comput. Graph.1
2009 Motion Compression using Principal Geodesics Analysis
abstract
Abstract Due to the growing need for large quantities of human animation data in the entertainment industry, it has become a necessity to compress motion capture sequences in order to ease their storage and transmission. We present a novel, lossy compression method for human motion data that exploits both temporal and spatial coherence. Given one motion, we first approximate the poses manifold using Principal Geodesics Analysis (PGA) in the configuration space of the skeleton. We then search this approximate manifold for poses matching end‐effectors constraints using an iterative minimization algorithm that allows for real‐time, data‐driven inverse kinematics. The compression is achieved by only storing the approximate manifold parametrization along with the end‐effectors and root joint trajectories, also compressed, in the output data. We recover poses using the IK algorithm given the end‐effectors trajectories. Our experimental results show that considerable compression rates can be obtained using our method, with few reconstruction and perceptual errors.
Maxime Tournier, Xiaomao Wu, Nicolas Courty, Elise Arnaud, Lionel Revéret
Comput. Graph. Forum1