Sciweavers

6 search results - page 1 / 2
» Adaptive deformations with fast tight bounds
Sort
View
SCA
2007
13 years 7 months ago
Adaptive deformations with fast tight bounds
Simulation of deformations and collision detection are two highly intertwined problems that are often treated separately. This is especially true in existing elegant adaptive simu...
Miguel A. Otaduy, Daniel Germann, Stephane Redon, ...
CA
2000
IEEE
13 years 9 months ago
Adaptive Simulation of Soft Bodies in Real-Time
This paper presents an adaptive technique to animate deformable bodies in real-time. In contrast to most previous work, we introduce a multi-resolution model that locally refines...
Gilles Debunne, Mathieu Desbrun, Marie-Paule Cani,...
CG
2008
Springer
13 years 5 months ago
Tight and efficient surface bounds in meshless animation
This paper presents a fast approach for computing tight surface bounds in meshless animation, and its application to collision detection. Given a high-resolution surface animated ...
Denis Steinemann, Miguel A. Otaduy, Markus H. Gros...
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
13 years 11 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
13 years 11 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl