Vendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : New. Print on Demand. This book delves into the fascinating and previously unsolved mathematical problem of enclosing a given polygon with the smallest possible circumscribed polygon. By presenting an innovative algorithm that can efficiently compute the minimum area circumscribing polygon for any polygon shape, the author provides a groundbreaking solution to this long-standing challenge. The book's meticulous analysis and clear exposition make it an invaluable resource for researchers and students in computational geometry, computer science, and mathematics. Through its exploration of complex geometric concepts, the book not only solves a fundamental problem but also contributes significantly to the advancement of these 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. N° de réf. du vendeur 9781333649838_0
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781333649838
Quantité disponible : 15 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781333649838
Quantité disponible : 15 disponible(s)