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.
Reseña del editor
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.
Reseña del editor
Excerpt from The Rectilinear Convex Skull Problem
In view of this lemma, we define the concavity of R to be rm 1mm. A region is called k-concave if its concavity is at most It. We will now characterize the k-concave regions for k S 2. A rectangular region is naturally represented by four parameters.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Otras ediciones populares con el mismo título
Resultados de la búsqueda para The Rectilinear Convex Skull Problem (Classic Reprint)
Imagen del vendedor
The Rectilinear Convex Skull Problem (Classic Reprint)
Impresión bajo demandaLibrería: Forgotten Books, London, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: New. Print on Demand. This book presents a framework for understanding the notion of concavity in rectilinear regions, exemplified by rectangular shapes. The author develops a combinatorial definition of concavity, which is then used to categorize different levels of concavity, including the familiar notion of convexity. The book investigates the problem of finding the largest rectilinear convex region within a given rectilinear region, presenting an efficient algorithm for solving this problem. The author also explores related problems, such as finding the largest convex region with specific properties, providing valuable insights into the nature and properties of rectilinear shapes. This book will appeal to mathematicians and computer scientists interested in computational geometry and the analysis of geometric shapes. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Nº de ref. del artículo: 9781333550189_0
Comprar nuevo
EUR 15,16
Gastos de envío:
GRATIS
De Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
The Rectilinear Convex Skull Problem Classic Reprint
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781333550189
Comprar nuevo
EUR 17,08
Gastos de envío:
GRATIS
A Estados Unidos de America
Cantidad disponible: 15 disponibles
Imagen de archivo
The Rectilinear Convex Skull Problem Classic Reprint
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781333550189
Comprar nuevo
EUR 16,24
Gastos de envío:
EUR 3,74
De Reino Unido a Estados Unidos de America
Cantidad disponible: 15 disponibles