The K-Gabriel Graphs and Their Applications
暂无分享,去创建一个
[1] Godfried T. Toussaint,et al. The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..
[2] Kenneth J. Supowit,et al. The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees , 1983, JACM.
[3] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[4] Robert E. Tarjan,et al. Algorithms for Two Bottleneck Optimization Problems , 1988, J. Algorithms.
[5] R. G. Parker,et al. Guaranteed performance heuristics for the bottleneck travelling salesman problem , 1984 .
[6] Bernard Chazelle,et al. An Improved Algorithm for Constructing k th-Order Voronoi Diagrams , 1987, IEEE Trans. Computers.
[7] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.
[8] R. Sokal,et al. A New Statistical Approach to Geographic Variation Analysis , 1969 .
[9] D. T. Lee,et al. On k-Nearest Neighbor Voronoi Diagrams in the Plane , 1982, IEEE Transactions on Computers.
[10] Udi Manber,et al. Probabilistic, Nondeterministic, and Alternating Decision Trees , 1982, STOC 1982.
[11] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[12] Harold N. Gabow,et al. A scaling algorithm for weighted matching on general graphs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[13] D. Matula,et al. Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane , 2010 .
[14] Udi Manber,et al. Probabilistic, nondeterministic, and alternating decision trees (Preliminary Version) , 1982, STOC '82.