On the reachability region of a ladder in two convex polygons
暂无分享，去创建一个
[1] Sue Whitesides,et al. Computational Geometry and Motion Planning , 1985 .
[2] JOSEPH O’ROURKE,et al. A new linear algorithm for intersecting convex polygons , 1982, Comput. Graph. Image Process..
[3] Kevin Q. Brown. Geometric transforms for fast geometric algorithms , 1979 .
[4] G. Toussaint,et al. Finding the minimum vertex distance between two disjoint convex polygons in linear time , 1985 .
[5] Herbert Edelsbrunner,et al. Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.
[6] B. Chazelle. Computational geometry and convexity , 1980 .
[7] Bernard Chazelle,et al. The Complexity and Decidability of Separation , 1984, ICALP.
[8] R. J. Dawson. On Removing a Ball Without Disturbing the Others , 1984 .
[9] D. T. Lee,et al. An Optimal Algorithm for Finding the Kernel of a Polygon , 1979, JACM.
[10] G. Toussaint. Solving geometric problems with the rotating calipers , 1983 .
[11] Godfried T. Toussaint,et al. Movable Separability of Sets , 1985 .
[12] Bernard Chazelle,et al. Detection is easier than computation (Extended Abstract) , 1980, STOC '80.
[13] Godfried T. Toussaint,et al. Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets , 1983, J. Algorithms.
[14] R. Melville. An Implementation Study of two Algorithms for the Minimum Spanning Circle Problem , 1985 .