论文信息 - The orthogonal convex skull problem

The orthogonal convex skull problem

We give a combinatorial definition of the notion of a simple orthogonal polygon beingk-concave, wherek is a nonnegative integer. (A polygon is orthogonal if its edges are only horizontal or vertical.) Under this definition an orthogonal polygon which is 0-concave is convex, that is, it is a rectangle, and one that is 1-concave is orthoconvex in the usual sense, and vice versa. Then we consider the problem of computing an orthoconvex orthogonal polygon of maximal area contained in a simple orthogonal polygon. This is the orthogonal version of the potato peeling problem. AnO(n2) algorithm is presented, which is a substantial improvement over theO(n7) time algorithm for the general problem.

Derick Wood | Chee-Keng Yap

[1] Jorg-Rudiger Wolfgang Sack,et al. Rectilinear computational geometry , 1984 .

[2] Bernard Chazelle,et al. Computing the Largest Empty Rectangle , 1986, SIAM J. Comput..

[3] Derick Wood,et al. On the Definition and Computation of Rectlinear Convex Hulls , 1984, Inf. Sci..

[4] Chee-Keng Yap,et al. A polynomial solution for the potato-peeling problem , 1986, Discret. Comput. Geom..

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

[6] Jacob E. Goodman,et al. On the largest convex polygon contained in a non-convex n-gon, or how to peel a potato , 1981 .

[7] Jack Sklansky,et al. Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.