Sciweavers

969 search results - page 49 / 194
» A New Metric Between Polygons and How to Compute it
Sort
View
CGF
2006
136views more  CGF 2006»
13 years 8 months ago
Cache-Efficient Layouts of Bounding Volume Hierarchies
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
Sung-Eui Yoon, Dinesh Manocha
CW
2008
IEEE
14 years 3 months ago
Automatic Surface Scanning of 3D Artifacts
—This paper describes an automatic 3D surface scanning technique using a 3D scanner. It allows the acquisition of a complete surface model of a 3D artifact without any manual reg...
Shiaofen Fang, Basil George, Mathew Palakal
ICIP
2003
IEEE
14 years 10 months ago
Generalized pattern matching using orbit decomposition
Image Processing and Computer Vision applications often require finding a particular pattern in a set of images. The task involves finding appearances of a given pattern in an ima...
Yacov Hel-Or, Hagit Hel-Or
PAMI
1998
74views more  PAMI 1998»
13 years 8 months ago
Selecting the Optimal Focus Measure for Autofocusing and Depth-From-Focus
—A method is described for selecting the optimal focus measure with respect to gray-level noise from a given set of focus measures in passive autofocusing and depth-from-focus ap...
Muralidhara Subbarao, Jenn-Kwei Tyan
ISESE
2006
IEEE
14 years 2 months ago
Predicting component failures at design time
How do design decisions impact the quality of the resulting software? In an empirical study of 52 ECLIPSE plug-ins, we found that the software design as well as past failure histo...
Adrian Schröter, Thomas Zimmermann, Andreas Z...