Sciweavers

1390 search results - page 1 / 278
» Computing the depth of a flat
Sort
View
SODA
2001
ACM
94views Algorithms» more  SODA 2001»
13 years 6 months ago
Computing the depth of a flat
We compute the regression depth of a k-flat in a set of n points in Rd, in time O(nd-2 + n log n) for 1 k d - 2. This contrasts with a bound of O(nd-1 + n log n) when k = 0 or
Marshall W. Bern
CW
2002
IEEE
13 years 9 months ago
Beyond Flat Panning and Zooming: Dolly-Enhanced SQTVR
This paper describes a novel solution to problems associated with interactive display of immersive stereographic imagery via Apple’s QuickTime Virtual Reality (QTVR) technology....
N. A. Bolhassan, William L. Martens, Michael M. Co...
TSMC
1998
122views more  TSMC 1998»
13 years 4 months ago
Dynamic adjustment of stereo display parameters
A review of the facts about human stereo vision leads to the conclusion that the human stereo processing mechanism is very flexible in the presence of other depth cues. Stereopsis ...
Colin Ware, Cyril Gobrecht, Mark Andrew Paton
CVPR
2008
IEEE
14 years 6 months ago
Flat refractive geometry
Tali Treibitz, Yoav Y. Schechner, Hanumant Singh
MM
2009
ACM
199views Multimedia» more  MM 2009»
13 years 11 months ago
Beyond flat surface computing: challenges of depth-aware and curved interfaces
In the past decade, multi-touch-sensitive interactive surfaces have transitioned from pure research prototypes in the lab, to commercial products with wide-spread adoption. One of...
Hrvoje Benko