53 search results - page 5 / 11 » Efficient Algorithms for Approximating Polygonal Chains |
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Automatic evaluation of visual tracking algorithms in the absence of ground truth is a very challenging and important problem. In the context of online appearance modeling, there ...
AFRIGRAPH
2003
ACM
13 years 11 months ago
2003
ACM
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
SI3D
1999
ACM
13 years 12 months ago
1999
ACM
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
ALMOB
2006
13 years 7 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
COMPUTING
2004
13 years 7 months ago
2004
We present a simple, accurate and efficient algorithm for collision detection among moving ellipsoids. Its efficiency is attributed to two results: (i) a simple algebraic test for...