Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 25,10
Cantidad disponible: 15 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 24,87
Cantidad disponible: 15 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: Forgotten Books, London, Reino Unido
EUR 15,76
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New. Print on Demand. This book explores the use of spanning trees with low stabbing numbers to solve efficiently a range of geometric problems like the arrangement of line segments in a plane, point location, polygon containment, and hidden surface removal. The book presents both deterministic and randomized algorithms that use roughly linear space (or sometimes quadratic space) and employ deterministic, rather than randomized, preprocessing techniques. The book derives from the work of researchers like Welzl, Edelsbrunner, Guibas, Suri and O'Rourke, and Agarwal and takes place within a broader research area of designing optimal algorithms for geometric problems. The author presents efficient algorithms that provide faster query times while still using roughly linear space, thus showcasing the versatility of spanning trees with low stabbing numbers as a tool that can be applied to obtain efficient algorithms for a large class of problems. 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.