Sciweavers

70 search results - page 14 / 14
» Origamizing Polyhedral Surfaces
Sort
View
COMPGEOM
1998
ACM
13 years 9 months ago
Constructing Approximate Shortest Path Maps in Three Dimensions
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
Sariel Har-Peled
CSR
2008
Springer
13 years 7 months ago
From Invariants to Canonization in Parallel
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
Johannes Köbler, Oleg Verbitsky
CGF
2002
168views more  CGF 2002»
13 years 5 months ago
Fast Continuous Collision Detection between Rigid Bodies
This paper introduces a fast continuous collision detection technique for polyhedral rigid bodies. As opposed to most collision detection techniques, the computation of the first ...
Stephane Redon, Abderrahmane Kheddar, Sabine Coqui...
IJCV
1998
192views more  IJCV 1998»
13 years 5 months ago
What Is the Set of Images of an Object Under All Possible Illumination Conditions?
The appearance of an object depends on both the viewpoint from which it is observed and the light sources by which it is illuminated. If the appearance of two objects is never iden...
Peter N. Belhumeur, David J. Kriegman
CVPR
1996
IEEE
13 years 9 months ago
What is the set of images of an object under all possible lighting conditions?
The appearance of a particular object depends on both the viewpoint from which it is observed and the light sources by which it is illuminated. If the appearance of two objects is...
Peter N. Belhumeur, David J. Kriegman