1274 search results - page 52 / 255 » The Geometry of Coin-Weighing Problems |
COMPGEOM
1996
ACM
14 years 2 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
3DPVT
2006
IEEE
14 years 4 months ago
2006
IEEE
In this paper we consider the problem of factoring illumination and texture from a pair of images of a diffuse object of known geometry. This problem arises frequently in 3D photo...
JCDCG
2004
Springer
14 years 3 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
COMPGEOM
2003
ACM
14 years 3 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re...