论文信息 - New techniques for some dynamic closest-point and farthest-point problems

New techniques for some dynamic closest-point and farthest-point problems

We present techniques for solving geometric closest-point aud farthest-point query problems, in the presence of deletions. Applications include efficient implementations of classical greedy heuristics for .miuimnmweight matching (where our result improves on that of Bentley and Saxe), and maximum-weight matching.

Kenneth J. Supowit | K. Supowit

[1] J. Michael Steele,et al. Worst-case greedy matchings in the unit d-cube , 1990, Networks.

[2] Michael Ian Shamos,et al. Geometric complexity , 1975, STOC.

[3] J. Michael Steele,et al. Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching , 1988, Probability in the Engineering and Informational Sciences.

[4] Jan van Leeuwen,et al. Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..

[5] Robert E. Tarjan,et al. On a Greedy Heuristic for Complete Matching , 1981, SIAM J. Comput..

[6] Jon Louis Bentley,et al. Multidimensional divide-and-conquer , 1980, CACM.

[7] Daniel J. Rosenkrantz,et al. An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[8] David Avis,et al. A survey of heuristics for the weighted matching problem , 1983, Networks.

[9] Jon Louis Bentley,et al. Divide and conquer algorithms for closest point problems in multidimensional space. , 1976 .

[10] Jon Louis Bentley,et al. Decomposable Searching Problems I: Static-to-Dynamic Transformation , 1980, J. Algorithms.

[11] D. Avis. Worst case bounds for the Euclidean matching problem , 1981 .

[12] Andrew Chi-Chih Yao,et al. On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..

[13] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .