215 search results - page 24 / 43 » Farthest-Polygon Voronoi Diagrams |
119
Voted
SI3D
2006
ACM
15 years 6 months ago
2006
ACM
This paper studies jump flooding as an algorithmic paradigm in the general purpose computation with GPU. As an example application of jump flooding, the paper discusses a constant...
97
Voted
STOC
2002
ACM
16 years 22 days ago
2002
ACM
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...
101
Voted
ICDM
2008
IEEE
15 years 6 months ago
2008
IEEE
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...
87
Voted
ISVD
2007
IEEE
15 years 6 months ago
2007
IEEE
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...
92
Voted
WINE
2005
Springer
15 years 6 months ago
2005
Springer
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...