Sciweavers

1368 search results - page 104 / 274
» Avoiding Simplicity Is Complex
Sort
View
CGF
2008
130views more  CGF 2008»
13 years 10 months ago
An Adaptive Contact Model for the Robust Simulation of Knots
In this paper, we present an adaptive model for dynamically deforming hyper-elastic rods. In contrast to existing approaches, adaptively introduced control points are not governed...
Jonas Spillmann, Matthias Teschner
CGF
2002
108views more  CGF 2002»
13 years 10 months ago
Real-time Animation of Dressed Virtual Humans
In this paper, we describe a method for cloth animation in real-time. The algorithm works in a hybrid manner exploiting the merits of both the physical-based and geometric deforma...
Frederic Cordier, Nadia Magnenat-Thalmann
TGC
2010
Springer
13 years 8 months ago
Certified Result Checking for Polyhedral Analysis of Bytecode Programs
Static analysers are becoming so complex that it is crucial to ascertain the soundness of their results in a provable way. In this paper we develop a certified checker in Coq that ...
Frédéric Besson, Thomas P. Jensen, D...
CORR
2010
Springer
39views Education» more  CORR 2010»
13 years 7 months ago
Non-redundant random generation from weighted context-free languages
We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of...
Yann Ponty
COMPGEOM
2011
ACM
13 years 1 months ago
On the structure and composition of forbidden sequences, with geometric applications
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
Seth Pettie