7351 search results - page 1045 / 1471 » Segmenting Point Sets |
159
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
We prove tight bounds on the complexity of bisectors and Voronoi diagrams on so-called realistic terrains, under the geodesic distance. In particular, if n denotes the number of tr...
169
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
We present a new streaming algorithm for maintaining an -kernel of a point set in Rd using O((1/(d-1)/2 ) log(1/)) space. The space used by our algorithm is optimal up to a small ...
202
click to vote
ESAW
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Electronic markets, dispute resolution and negotiation protocols are three types of application domain that can be viewed as open agent systems. Members of such systems a...
168
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We initiate the study of on-line metric embeddings. In such an embedding we are given a sequence of n points X = x1, . . . , xn one by one, from a metric space M = (X, D). Our goal...
173
click to vote
CCCG
2010
15 years 8 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...