9781334013676 - a polynomial solution for potato-peeling problem (classic reprint) di chang, j. s. (3 risultati)
- Brossura
Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 25,60
Spedizione gratuitaSpedito in U.S.A.Quantità: 15 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Brossura
Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 24,47
EUR 4,86 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 15 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Altre immagini
- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 15,54
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: 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 the…se 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.
