CiteSeerX — Lazy Algorithms for Dynamic Closest Pair with Arbitrary Distance Measures

Lazy Algorithms for Dynamic Closest Pair with Arbitrary Distance Measures (2004) [2 citations — 0 self]

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@TECHREPORT{Cardinal04lazyalgorithms,
    author = {Jean Cardinal and David Eppstein},
    title = {Lazy Algorithms for Dynamic Closest Pair with Arbitrary Distance Measures},
    institution = {In Algorithm Engineering and Experiments Workshop (ALENEX},
    year = {2004}
}

Bookmarks

OpenURL

Abstract:

We propose novel lazy algorithms for the dynamic closest pair problem with arbitrary distance measures. They use a simple delayed computation mechanism to spare distance calculations. One of them is a lazy version of the FastPair algorithm recently proposed by Eppstein. Experimental results on a wide number of applications show that lazy FastPair always perform significantly better than FastPair.

Citations

71	A new vector quantization clustering algorithm – Equitz - 1989
43	Fast hierarchical clustering and other applications of dynamic closest pairs – Eppstein
33	Algorithms for dynamic closest-pair and n-body potential fields – Callahan, Kosaraju - 1995
30	An optimal algorithm for closest-pair maintenance – BESPAMYATNIKH - 1998
28	Experiments on Traveling Salesman Heuristics – Bentley - 1990
15	On a greedy heuristic for complete matching – Reingold, Tarjan - 1981
13	A clustering algorithm for entropyconstrained vector quantizer design with applications in coding image pyramids – Garrido, Pearlman, et al. - 1995
9	Dynamic algorithms for half-space reporting, proximity problems, and geometric minimum spanning trees – Agarwal, Eppstein, et al. - 1992
1	Fast and space ecient PNN algorithm with delayed distance calculations – Kaukoranta, Franti, et al. - 1998
1	Algorithms for Geometric Traveling Salesman Problems – Fast - 1992
1	Fast and space efficient PNN algorithm with delayed distance calculations – Kaukoranta, Franti, et al. - 1998