Sciweavers

3640 search results - page 415 / 728
» The Geometry of Web Search
Sort
View
COMPGEOM
1998
ACM
15 years 11 months ago
Viewspace Partitioning of Densely Occluded Scenes
Computing the visibility of out-door scenes is often much harder than of in-door scenes. A typical urban scene, for example, is densely occluded, and it is effective to precompute...
Yiorgos Chrysanthou, Daniel Cohen-Or, Eyal Zadicar...
COMPGEOM
1996
ACM
15 years 11 months ago
Simple Traversal of a Subdivision Without Extra Storage
In this paper we show how to traverse a subdivision and to report all cells, edges and vertices, without making use of mark bits in the structure or a stack. We do this by perform...
Mark de Berg, René van Oostrum, Mark H. Ove...
JGTOOLS
2006
111views more  JGTOOLS 2006»
15 years 6 months ago
Stochastic Billboard Clouds for Interactive Foliage Rendering
We render tree foliage levels of detail (LODs) using a new adaptation of billboard clouds. Our contributions are a simple and efficient billboard cloud creation algorithm designed...
J. Dylan Lacewell, David Edwards, Peter Shirley, W...
CVPR
2011
IEEE
1838views Computer Vision» more  CVPR 2011»
15 years 4 months ago
Reconstructing an image from its local descriptors
This paper shows that an image can be approximately reconstructed based on the output of a blackbox local description software such as those classically used for image indexing. Ou...
Philippe Weinzaepfel, Hervé Jégou and Patrick Pe...
216
Voted
CGF
2011
14 years 10 months ago
A Sparse Parametric Mixture Model for BTF Compression, Editing and Rendering
Bidirectional texture functions (BTFs) represent the appearance of complex materials. Three major shortcomings with BTFs are the bulky storage, the difficulty in editing and the ...
Hongzhi Wu, Julie Dorsey, Holly E. Rushmeier