Finding minimal convex nested polygons
暂无分享,去创建一个
[1] G. Toussaint. Solving geometric problems with the rotating calipers , 1983 .
[2] Edward P. F. Chan,et al. Finding the minimum visible vertex distance between two non-intersecting simple polygons , 1986, SCG '86.
[3] Chee-Keng Yap,et al. A Polynomial Solution for Potato-peeling and other Polygon Inclusion and Enclosure Problems , 1984, FOCS.
[4] Dov Dori,et al. Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition , 1983, Comput. Vis. Graph. Image Process..
[5] Victor Klee,et al. Finding the Smallest Triangles Containing a Given Convex Polygon , 1985, J. Algorithms.
[6] N. Pano,et al. Polygon approximation with optimized polygonal enclosures: applications and algorithms , 1987 .
[7] Alok Aggarwal,et al. An Optimal Algorithm for Finding Minimal Enclosing Triangles , 1986, J. Algorithms.
[8] Alok Aggarwal,et al. Geometric applications of a matrix-searching algorithm , 1987, SCG '86.