Computing a convex skill of an orthogonal polygon
暂无分享,去创建一个
Given a simple orthogonal polygon, that is a simple polygon whose edges are parallel to the axes, we wish to determine an inscribed convex orthogonal polygon of maximal area. This is the orthogonal version of the potato peeling problem. We present an &Ogr;(<italic>n</italic><supscrpt>2</supscrpt>) time algorithm to solve it, which is a substantial improvement over the &Ogr;(<italic>n</italic><supscrpt>7</supscrpt> time algorithm for the general problem.
[1] Jack Sklansky,et al. Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.
[2] Derick Wood,et al. On the Definition and Computation of Rectlinear Convex Hulls , 1984, Inf. Sci..
[3] Jacob E. Goodman,et al. On the largest convex polygon contained in a non-convex n-gon, or how to peel a potato , 1981 .