Lazy algorithms for dynamic closest pair with arbitrary distance measures

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithms and Combinatorics

Volumn , Issue , 2004, Pages 112-119

  Cardinal, Jean ^a   Eppstein, David ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER SOFTWARE; LINEAR SYSTEMS; PROBLEM SOLVING; SET THEORY; TRAVELING SALESMAN PROBLEM;

CLUSTERINGS; EUCLIDEANNESS; LAZY ALGORITHMS;

ALGORITHMS;

EID: 8444245232     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. J. Bentley. Experiments on traveling salesman heuristics. In SODA: ACM-SIAM Symposium on Discrete Algorithms, pages 91-99, 1990.
2. _. Fast Algorithms for Geometric Traveling Salesman Problems. In ORSA Journal on Computing, 4(4):387-411, 1992.
3. S. N. Bespamyatnikh. An optimal algorithm for closest pair maintenance. In COMPGEOM: Annual ACM Symposium on Computational Geometry, 1995.
4. P. B. Callahan and S. R. Kosaraju. Algorithms for dynamic closest pair and n-body potential fields. In SODA: ACM-SIAM Symposium on Discrete Algorithms, 1995.
5. J. Cardinal and D. Eppstein. Lazy algorithms for dynamic closest pair with arbitrary distance measures. Technical Report 502, ULB, 2003.
6. D. P. deGarrido, W. A. Pearlman, and W. A. Finamore. A clustering algorithm for entropy-constrained quantizer design with applications in coding image pyramids. IEEE Trans. on Circuits and Sytems for Video Technology, 5:83-85, 1995.
7. R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification. Wiley-Interscience, 2nd edition, 2000.
8. D. Eppstein. Fast hierarchical clustering and other applications of dynamic closest pairs. J. Experimental Algorithmcs, 5(1):1-23, 2000. also in 9th ACM-SIAM Symp. on Discrete Algorithms, 1998, pp. 619-628.
9. D. Eppstein. Fast hierarchical clustering and other applications of dynamic closest pairs. J. Experimental Algorithmcs, 5(1):1-23, 2000. also in 9th ACM-SIAM Symp. on Discrete Algorithms, 1998, pp. 619-628.
10. D. Eppstein, P. Agarwal, and J. Matousek. Dynamic algorithms for half-space reporting, proximity problems, and geometric minimum spanning trees. In IEEE Annual Symposium on Foundations of Computer Science (FOCS), 1992.
11. W. H. Equitz. A new vector quantization clustering algorithm. IEEE Trans. Acoust., Speech, Signal Processing, 37(10):1568-1575, October 1989.
12. T. Kaukoranta, P. Franti, and O. Nevalainen. Fast and space efficient PNN algorithm with delayed distance calculations. In 8th International Conference on Computer Graphics and Visualization (GraphiCon'98), 1998.
13. E. M. Reingold and R. E. Tarjan. On a greedy heuristic for complete matching. SIAM J. of Computing, 10(4):676-681, 1981.