Solving geometric problems with the rotating calipers
暂无分享,去创建一个
[1] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.
[2] Herbert Freeman,et al. Determining the minimum-area encasing rectangle for an arbitrary closed curve , 1975, CACM.
[3] F. P. Preparata,et al. Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.
[4] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[5] Godfried T. Toussaint,et al. PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .
[6] Leonidas J. Guibas,et al. On translating a set of rectangles , 1980, STOC '80.
[7] Joseph O'Rourke,et al. An on-line algorithm for fitting straight lines between data ranges , 1981, CACM.
[8] Frans C. A. Groen,et al. The smallest box around a package , 1981, Pattern Recognit..
[9] Godfried T. Toussaint,et al. A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets , 1982, Pattern Recognit. Lett..
[10] Godfried T. Toussaint,et al. Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets , 1983, J. Algorithms.