1390 search results - page 6 / 278 » Computing the depth of a flat |
RT
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. This paper proposes a simple augmentation to texture mapping hardware which produces the correct depth buffer content and hence correct visibility when replacing complex ...
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
An efficient algorithm is presented for the computation of gray-scale morphological operations with 2-D structuring elements (S.E.). The required computing time is independent of ...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Range imaging has become a critical component of many computer vision applications. The quality of the depth data is of critical importance, but so is the need for speed. Shuttere...
CONEXT
2010
ACM
13 years 5 months ago
2010
ACM
We introduce a protocol which routes on flat, locationindependent identifiers with guaranteed scalability and low stretch. Our design builds on theoretical advances in the area of...
ATVA
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. Symbolic model checking provides partially effective verification procedures that can handle systems with an infinite state space. So-called “acceleration techniques...