215 search results - page 39 / 43 » Farthest-Polygon Voronoi Diagrams |
104
Voted
ICNP
2003
IEEE
15 years 3 months ago
2003
IEEE
Abstract—In the paper, we devise and evaluate a fully decentralized, light-weight, dynamic clustering algorithm for target tracking. Instead of assuming the same role for all the...
189
Voted
VLDB
2006
ACM
15 years 10 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
125
Voted
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
139
Voted
Publication
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general as it...
CVPR
2001
IEEE
16 years 8 days ago
2001
IEEE
This paper presents a novel processing scheme for the automatic computation of a medial shape model which is representative for an object population with shape variability. The se...