Sciweavers

2342 search results - page 251 / 469
» Sublinear geometric algorithms
Sort
View
COLT
2000
Springer
15 years 11 months ago
The Computational Complexity of Densest Region Detection
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
Shai Ben-David, Nadav Eiron, Hans-Ulrich Simon
VISUALIZATION
1999
IEEE
15 years 10 months ago
Time-Critical Multiresolution Scene Rendering
We describe a framework for time-critical rendering of graphics scenes composed of a large number of objects having complex geometric descriptions. Our technique relies upon a sce...
Enrico Gobbetti, Eric Bouvier
SIGGRAPH
1997
ACM
15 years 10 months ago
Progressive simplicial complexes
In this paper, we introduce the progressive simplicial complex (PSC) representation, a new format for storing and transmitting triangulated geometric models. Like the earlier prog...
Jovan Popovic, Hugues Hoppe
SIGGRAPH
1996
ACM
15 years 10 months ago
Hierarchical Image Caching for Accelerated Walkthroughs of Complex Environments
We present a new method that utilizes path coherence to accelerate walkthroughs of geometrically complex static scenes. As a preprocessing step, our method constructs a BSP-tree t...
Jonathan Shade, Dani Lischinski, David Salesin, To...
AMDO
2006
Springer
15 years 10 months ago
Monocular Tracking with a Mixture of View-Dependent Learned Models
This paper considers the problem of monocular human body tracking using learned models. We propose to learn the joint probability distribution of appearance and body pose using a m...
Tobias Jaeggli, Esther Koller-Meier, Luc J. Van Go...