2183 search results - page 240 / 437 » Multi-pass geometric algorithms |
152
click to vote
SIGGRAPH
1999
ACM
15 years 10 months ago
1999
ACM
Bus traffic between the graphics subsystem and memory can become a bottleneck when rendering geometrically complex meshes. In this paper, we investigate the use of vertex caching...
163
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
201
click to vote
WSCG
2004
15 years 7 months ago
2004
Most of the existing algorithms for decimation of triangular meshes perform poorly at very low levels of detail. We propose a new automatic method for the decimation of triangular...
170
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
The fundamental matrix is a central construct in the analysis of images captured from a pair of cameras and many feature-based methods have been proposed for its computation. In t...
177
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We propose a novel algorithm for clustering data sampled from multiple submanifolds of a Riemannian manifold. First, we learn a representation of the data using generalizations of...