论文信息 - Minimum area circumscribing Polygons - 字舞流文

Minimum area circumscribing Polygons

We show that the smallestk-gon circumscribing a convexn-gon can be computed inO(n2 logn logk) time.

Alok Aggarwal | Chee-Keng Yap | Jyun-Sheng Chang

[1] Alok Aggarwal,et al. An Optimal Algorithm for Finding Minimal Enclosing Triangles , 1986, J. Algorithms.

[2] Victor Klee,et al. Finding the Smallest Triangles Containing a Given Convex Polygon , 1985, J. Algorithms.

[3] Joseph O'Rourke. Counterexamples to a minimal circumscription algorithm , 1985, Comput. Vis. Graph. Image Process..

[4] Chee-Keng Yap,et al. A Polynomial Solution for Potato-peeling and other Polygon Inclusion and Enclosure Problems , 1984, FOCS.

[5] Dov Dori,et al. Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition , 1983, Comput. Vis. Graph. Image Process..

[6] David P. Dobkin,et al. On a general method for maximizing and minimizing among certain geometric problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[7] David P. Dobkin,et al. Finding Extremal Polygons , 1985, SIAM J. Comput..

[8] Herbert Freeman,et al. Determining the minimum-area encasing rectangle for an arbitrary closed curve , 1975, CACM.