Sciweavers

221 search results - page 16 / 45
» Rounding Voronoi diagram
Sort
View
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
14 years 10 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
ICDM
2008
IEEE
185views Data Mining» more  ICDM 2008»
14 years 4 months ago
Clustering Uncertain Data Using Voronoi Diagrams
We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises t...
Ben Kao, Sau Dan Lee, David W. Cheung, Wai-Shing H...
ISVD
2007
IEEE
14 years 4 months ago
From the Kneser-Poulsen conjecture to ball-polyhedra via Voronoi diagrams
A very fundamental geometric problem on finite systems of spheres was independently phrased by Kneser (1955) and Poulsen (1954). According to their well-known conjecture if a fi...
Károly Bezdek
WINE
2005
Springer
135views Economy» more  WINE 2005»
14 years 3 months ago
On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams
Owing to numerous potential applications, wireless sensor networks have been the focus of a lot of research efforts lately. In this note we study one fundamental issue in such net...
Anthony Man-Cho So, Yinyu Ye
TKDE
2010
251views more  TKDE 2010»
13 years 8 months ago
Clustering Uncertain Data Using Voronoi Diagrams and R-Tree Index
—We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises...
Ben Kao, Sau Dan Lee, Foris K. F. Lee, David Wai-L...