6 search results - page 1 / 2 » On the Smallest Enclosing Information Disk |
CCCG
2006
13 years 6 months ago
2006
We present a generalization of Welzl's smallest enclosing disk algorithm [E. Welzl, Smallest enclosing disks (balls and ellipsoids), in: New Results and New Trends in Compute...
CCCG
2004
13 years 6 months ago
2004
ESA
2003
Springer
13 years 10 months ago
2003
Springer
In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...
PCI
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Given two datasets DA and DB the closest-pair query (CPQ) retrieves the pair (a,b), where a ∈ DA and b ∈ DB, having the smallest distance between all pairs of objects...
ISCI
2007
13 years 4 months ago
2007
Selectivity estimation is an important step of query optimization in a database management system, and multidimensional histogram techniques have proved promising for selectivity ...