Sciweavers

1390 search results - page 2 / 278
» Computing the depth of a flat
Sort
View
HOTI
2005
IEEE
13 years 11 months ago
Challenges in Building a Flat-Bandwidth Memory Hierarchy for a Large-Scale Computer with Proximity Communication
Memory systems for conventional large-scale computers provide only limited bytes/s of data bandwidth when compared to their flop/s of instruction execution rate. The resulting bo...
Robert J. Drost, Craig Forrest, Bruce Guenin, Ron ...
COMPGEOM
1999
ACM
13 years 9 months ago
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
Erik D. Demaine, Martin L. Demaine, Joseph S. B. M...
ESA
2011
Springer
252views Algorithms» more  ESA 2011»
12 years 5 months ago
Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane
Over the past several decades, many combinatorial measures have been devised for capturing the statistical data depth of a set of n points in R2 . These include Tukey depth [15], O...
Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir
ICPR
2008
IEEE
14 years 6 months ago
Usage of needle maps and shadows to overcome depth edges in depth map reconstruction
Photometric stereo is a method of recovering surface normals (needle map) from images. The surface integral of surface normals is used to reconstruct a depth map; however, the dep...
Koh Kakusho, Koki Hamada, Masaaki Iiyama, Michihik...