Sciweavers

6 search results - page 1 / 2
» On the Smallest Enclosing Information Disk
Sort
View
CCCG
2006
15 years 1 months ago
On the Smallest Enclosing Information Disk
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...
Frank Nielsen, Richard Nock
78
Voted
CCCG
2004
15 years 1 months ago
Approximating smallest enclosing disks
Frank Nielsen, Richard Nock
94
Voted
ESA
2003
Springer
96views Algorithms» more  ESA 2003»
15 years 5 months ago
Streaming Geometric Optimization Using Graphics Hardware
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...
Pankaj K. Agarwal, Shankar Krishnan, Nabil H. Must...
PCI
2005
Springer
15 years 5 months ago
Closest Pair Queries with Spatial Constraints
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...
Apostolos N. Papadopoulos, Alexandros Nanopoulos, ...
ISCI
2007
115views more  ISCI 2007»
15 years 4 days ago
Compressed histograms with arbitrary bucket layouts for selectivity estimation
Selectivity estimation is an important step of query optimization in a database management system, and multidimensional histogram techniques have proved promising for selectivity ...
Dennis Fuchs, Zhen He, Byung Suk Lee