The Rectilinear Convex Skull Problem (Classic Reprint) - Tapa dura

Sinopsis

Excerpt from The Rectilinear Convex Skull Problem

The general problem is the following: given a simple polygon, the largest area convex polygon contained in it. I. Goodman [goo] called this the 'potato peeling problem'; he also posed the question of finding a finite algorithm for the problem. Independently, [woo] considered the problem, dubbing it the 'convex skull problem'. Recently, [0i gave a finiteness criteria for the largest convex included polygon and solved the problem in 0(n°log n) time. In this report, we investigate the rectilinear versions of this problem. Note that the finiteness of the convex skull problem in the rectilinear case is easy.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

"Sinopsis" puede pertenecer a otra edición de este libro.