An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
暂无分享,去创建一个
[1] Kenneth J. Supowit,et al. The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees , 1983, JACM.
[2] Bernard Chazelle,et al. Detection is easier than computation (Extended Abstract) , 1980, STOC '80.
[3] D. T. Lee,et al. The All Nearest-Neighbor Problem for Convex Polygons , 1978, Inf. Process. Lett..
[4] G. Toussaint,et al. Finding the minimum vertex distance between two disjoint convex polygons in linear time , 1985 .
[5] Godfried T. Toussaint,et al. Optimal algorithms for computing the minimum distance between two finite planar sets , 1983, Pattern Recognit. Lett..
[6] D. T. Lee,et al. A Note on the all Nearest-Neighbor Problem for Convex Polygons , 1979, Inf. Process. Lett..
[7] JOSEPH O’ROURKE,et al. A new linear algorithm for intersecting convex polygons , 1982, Comput. Graph. Image Process..
[8] Jacob T. Schwartz,et al. Finding the Minimum Distance Between Two Convex Polygons , 1981, Information Processing Letters.
[9] B. Chazelle. Computational geometry and convexity , 1980 .
[10] Herbert Edelsbrunner,et al. Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.