We address the problem of estimating the three-dimensional shape and radiance of a surface in space from images obtained with different focal settings. We pose the problem as an in...
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
In [8] we posed a series of extremal (set system) problems under dimension constraints. In the present paper we study one of them: the intersection problem. The geometrical formul...
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khac...
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Mahesh...