Sciweavers

1390 search results - page 167 / 278
» Computing the depth of a flat
Sort
View
CGI
1998
IEEE
15 years 2 months ago
Hierarchical Visibility Culling with Occlusion Trees
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
Jirí Bittner, Vlastimil Havran, Pavel Slav&...
IPPS
1998
IEEE
15 years 2 months ago
Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations
A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switchbased networks of workstations. The algorithm is optimal with respect t...
Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Raja...
CVPR
1996
IEEE
15 years 2 months ago
Occlusion Detectable Stereo -- Occlusion Patterns in Camera Matrix
In stereo algorithms with more than two cameras, the improvement of accuracy is often reported since they are robust against noise. However, another important aspect of the polyno...
Yuichi Nakamura, Tomohiko Matsuura, Kiyohide Satoh...
3DPVT
2004
IEEE
125views Visualization» more  3DPVT 2004»
15 years 1 months ago
GPU-Assisted Z-Field Simplification
Height fields and depth maps which we collectively refer to as z-fields, usually carry a lot of redundant information and are often used in real-time applications. This is the rea...
Alexander Bogomjakov, Craig Gotsman
CG
2006
Springer
15 years 1 months ago
Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search
Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations, and can serve as an evaluation function at the leaves of a min-ma...
Rémi Coulom