ISBN: 9781334013676 - a polynomial solution for potato-peeling problem (classic reprint) (3 Ergebnisse)

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Zustand: New. Print on Demand. This book presents a polynomial-time solution to two problems in computational geometry: the potato-peeling problem and the convex skull problem. Both problems ask for the largest convex polygon contained within a given polygon. The author provides a detailed algorithm for solving these problems that runs in O(n^7) time, where n is the number of vertices in the given polygon. This algorithm is a significant improvement over previous solutions, which ran in exponential time. The author also discusses the broader context of these problems within computational geometry and provides insights into the thematic depth of the ideas presented. Overall, this book is a valuable resource for researchers and students in computational geometry and related fields. 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.…