256 search results - page 6 / 52 » Complexity and algorithms for computing Voronoi cells of lat... |
OPODIS
2007
13 years 10 months ago
2007
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
JCSS
2007
13 years 8 months ago
2007
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is â™...
ECCV
2000
Springer
14 years 10 months ago
2000
Springer
The medial surface of a volumetric object is of significant interest for shape analysis. However, its numerical computation can be subtle. Methods based on Voronoi techniques prese...
ESA
2007
Springer
14 years 2 months ago
2007
Springer
Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the dis...
CVPR
2000
IEEE
14 years 10 months ago
2000
IEEE
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...