215 search results - page 39 / 43 » Farthest-Polygon Voronoi Diagrams |
ICNP
2003
IEEE
14 years 25 days 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...
VLDB
2006
ACM
14 years 7 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...
COMPGEOM
2010
ACM
14 years 19 days 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 ...
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
14 years 9 months 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...