Sciweavers

302 search results - page 48 / 61
» Intersecting with Unaware Objects
Sort
View
EGH
2005
Springer
15 years 3 months ago
KD-tree acceleration structures for a GPU raytracer
Modern graphics hardware architectures excel at compute-intensive tasks such as ray-triangle intersection, making them attractive target platforms for raytracing. To date, most GP...
Tim Foley, Jeremy Sugerman
FC
2005
Springer
142views Cryptology» more  FC 2005»
15 years 3 months ago
Testing Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
Aggelos Kiayias, Antonina Mitrofanova
KES
2005
Springer
15 years 3 months ago
3-D Building Reconstruction Using IKONOS Multispectral Stereo Images
This paper presents an effective strategy to extract the buildings and to reconstruct 3-D buildings using high-resolution multispectral stereo satellite images. Proposed scheme con...
Hong-Gyoo Sohn, Choung-Hwan Park, Joon Heo
COMPGEOM
2004
ACM
15 years 3 months ago
The number of lines tangent to arbitrary convex polyhedra in 3D
We prove that the lines tangent to four possibly intersecting convex polyhedra in   3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
Hervé Brönnimann, Olivier Devillers, V...
101
Voted
FSTTCS
2004
Springer
15 years 3 months ago
Approximate Range Searching Using Binary Space Partitions
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
Mark de Berg, Micha Streppel