Publications

@inproceedings{servin2006interactive,

title = {Interactive simulation of elastic deformable materials},

author = {Martin Servin and Claude Lacoursière and Niklas Melin},

url = {https://ep.liu.se/ecp/019/005/ecp01905.pdf

https://ep.liu.se/konferensartikel.aspx?series=ecp&issue=19&Article_No=5},

year  = {2006},

date = {2006-01-01},

booktitle = {SIGRAD 2006. The Annual SIGRAD Conference; Special Theme: Computer Games},

number = {019},

organization = {Linköping University Electronic Press},

abstract = {A novel; fast; stable; physics-based numerical method for interactive simulation of elastically deformable objects is presented. Starting from elasticity theory; the deformation energy is modeled in terms of the positions of point masses using the linear shape functions of finite element analysis; providing for an exact correspondence between the known physical properties of deformable bodies such as Young’s modulus; and the simulation parameter. By treating the infinitely stiff case as a kinematic constraint on a system of point particles and using a regularization technique; a stable first order stepping algorithm is constructed which allows the simulation of materials over the entire range of stiffness values; including incompressibility. The main cost of this method is the solution of a linear system of equations which is large but sparse. Commonly available sparse matrix packages can process this problem with linear complexity in the number of elements for many cases. This method is contrasted with other well-known point mass models of deformable solids which rely on penalty forces constructed from simple local geometric quantities; e.g.; spring-and-damper models. For these; the mapping between the simulation parameters and the physical observables is not well defined and they are either strongly limited to the low stiffness case when using explicit integration methods; or produce grossly inaccurate results when using simple linearly implicit method. Validation and timing tests on the new method show that it produces very good physical behavior at a moderate computational cost; and it is usable in the context of real-time interactive simulations.},

keywords = {Algoryx},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{backman2005colosseum3d,

title = {Colosseum3D-Authoring framework for Virtual Environments.},

author = {Anders Backman},

url = {http://www8.cs.umu.se/research/ifor/dl/SEQUENCE%20LEARINIG/colosseum3d_egve05.pdf},

year  = {2005},

date = {2005-01-01},

booktitle = {IPT/EGVE},

pages = {225--226},

organization = {Citeseer},

abstract = {This paper describes an authoring environment for real time 3D environments, Colosseum3D. The framework makes it possible to easily create rich virtual environments with rigid-body dynamics, 3D rendering using OpenGL Shaders, 3D sound and human avatars. The creative process of building com- plex simulators is supported by allowing several authoring paths such as a low level C++ API, an ex- pressive high level file format and a scripting layer. To exemplify the use of the framework, an immersive wheelchair simulator application is presented. A natural and intuitive interaction method is implemented using dynamic simulation.},

keywords = {Algoryx},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{lacoursiere2003splitting,

title = {Splitting methods for dry frictional contact problems in rigid multibody systems: Preliminary performance results},

author = {Claude Lacoursière},

url = {http://www.ep.liu.se/ecp/010/004/ecp01004.pdf

https://ep.liu.se/en/conference-article.aspx?series=ecp&issue=10&Article_No=4},

year  = {2003},

date = {2003-01-01},

booktitle = {The Annual SIGRAD Conference. Special Theme-Real-Time Simulations. Conference Proceedings from SIGRAD2003},

number = {010},

pages = {11--16},

organization = {Linköping University Electronic Press},

abstract = {A splitting method for solving LCP based models of dry frictional contact problems in rigid multibody systems based on box MLCP solver is presented. Since such methods rely on fast and robust box MLCP solvers; several methods are reviewed and their performance is compared both on random problems and on simulation data. We provide data illustrating the convergence rate of the splitting method which demonstrates that they present a viable alternative to currently available methods.},

keywords = {Algoryx},

pubstate = {published},

tppubtype = {inproceedings}

}