401 search results - page 19 / 81 » Algorithms for a Simple Point Placement Problem |
DCG
1998
13 years 7 months ago
1998
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
COMPGEOM
1994
ACM
13 years 11 months ago
1994
ACM
For two given point sets, we present a very simple (almost trivial) algorithm to translate one set so that the Hausdor distance between the two sets is not larger than a constant ...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Correspondence establishment is a key step in statistical shape model building. There are several automated methods for solving this problem in 3D, but they usually can only handl...
ALGOSENSORS
2008
Springer
13 years 9 months ago
2008
Springer
With the current progress in robot technology and related areas, sophisticated moving and sensing capabilities are at hand to design robots capable of solving seemingly complex tas...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...