L Guibas (5 results)

- Softcover
Seller: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contact seller5-star sellerCondition: New
US$ 27.97
Free ShippingShips within U.S.A.Quantity: 15 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.

- Softcover
Seller: PBShop.store UK, Fairford, GLOS, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
US$ 27.74
US$ 4.33 shippingShips from United Kingdom to U.S.A.Quantity: 15 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.

- Hardcover
Seller: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contact seller5-star sellerCondition: New
US$ 38.43
Free ShippingShips within U.S.A.Quantity: 15 available
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.

- Hardcover
Seller: PBShop.store UK, Fairford, GLOS, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
US$ 37.20
US$ 5.47 shippingShips from United Kingdom to U.S.A.Quantity: 15 available
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.

- Softcover
- Print on Demand
Seller: Forgotten Books, London, United KingdomForgotten Books
Contact seller5-star sellerCondition: New
US$ 17.58
Free ShippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback. Condition: New. No Jacket. Print on Demand. Unlock fast solutions for visibility and shortest paths inside simple polygons. This work presents new linear-time algorithms that build on a triangulation of the polygon to solve key geometric problems. It offers practical methods and data structures that enable fast queries and preprocessing for complex polygon scenes.The book shows how to compute a shortest path tree from a fixed point, determine which parts of the polygon are visible from a given edge or point, and perform fast shooting queries that find where a ray first hits the boundary. It also covers hierarchical decompositions, hourglass structures, and convex rope calculations, all designed to run in linear time with careful data organization. The results extend the state of the art in linear-time polygon processing and connect visibility with shortest-path problems through concrete algorithms and proofs.- Learn how to build a shortest-path tree inside a simple polygon in linear time- See how to preprocess a polygon for logarithmic-time visibility and shooting queries- Explore hierarchical decompositions and hourglass structures used in fast computations- Discover the convex rope approach to reachability and related geometric problemsIdeal for readers of computational geometry seeking practical, fast algorithms for visibility, shortest paths, and related polygon 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.…