174 search results - page 4 / 35 » Algorithms for center and Tverberg points |
SODA
1997
ACM
13 years 8 months ago
1997
ACM
Improving on a recent breakthrough of Sharir, we find two minimum-radius circular disks covering a planar point set, in randomized expected time O(n log2 n).
PAMI
2006
13 years 7 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
JGTOOLS
2008
13 years 7 months ago
2008
We study the behavior of simple, 2-D, self-organizing primitives that interact and move in an unbounded environment to create aggregated shapes. Each primitive is represented by a ...
CCCG
2007
13 years 8 months ago
2007
Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...
AOR
2006
13 years 7 months ago
2006
In this paper we briefly review the importance of LP (linear programming), and Dantzig's main contributions to OR (Operations Research), mathematics, and computer science. In...