Sciweavers

464 search results - page 83 / 93
» On the Computational Complexity of Hierarchical Radiosity
Sort
View
73
Voted
SIGGRAPH
2000
ACM
15 years 1 months ago
Surfels: surface elements as rendering primitives
Surface elements (surfels) are a powerful paradigm to efficiently render complex geometric objects at interactive frame rates. Unlike classical surface discretizations, i.e., tri...
Hanspeter Pfister, Matthias Zwicker, Jeroen van Ba...
CVPR
2008
IEEE
15 years 11 months ago
People-tracking-by-detection and people-detection-by-tracking
Both detection and tracking people are challenging problems, especially in complex real world scenes that commonly involve multiple people, complicated occlusions, and cluttered o...
Mykhaylo Andriluka, Stefan Roth, Bernt Schiele
88
Voted
SI3D
2005
ACM
15 years 3 months ago
Texture sprites: texture elements splatted on surfaces
We present a new interactive method to texture complex geometries at very high resolution, while using little memory and without the need for a global planar parameterization. We ...
Sylvain Lefebvre, Samuel Hornus, Fabrice Neyret
COMPUTING
2008
174views more  COMPUTING 2008»
14 years 9 months ago
Multilevel algorithms for Rannacher-Turek finite element approximation of 3D elliptic problems
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
Ivan Georgiev, Johannes Kraus, Svetozar Margenov
SIGMOD
1997
ACM
107views Database» more  SIGMOD 1997»
15 years 1 months ago
Range Queries in OLAP Data Cubes
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is speci ed by providing ranges of values for numeric dimensions. W...
Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ram...