0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc (Classic Reprint) - Softcover
Synopsis
Efficient parallel methods for computing boundaries of unions and intersections. This book explains how to determine the boundary shape created when many circular discs in the plane overlap, using parallel algorithms that run in polylog time.
The text presents a concrete characterization of the boundary, along with time and processor counts for both CREW and CRCW PRAM models. It shows how to compute all boundary arcs quickly and how to walk along the resulting contour. The work also analyzes how many boundary arcs can appear and proves results about the structure of the intersection and union of large sets of discs. Readers will find a blend of geometric insight, formal definitions, and parallel algorithm design that demonstrates the practical potential of parallel time theory for planar geometry.
- How to represent disc boundaries and related arcs in a precise, computable way.
- Parallel procedures to identify key points on boundaries and to assemble the overall contour of intersection and union.
- Analysis of time complexity and processor requirements on CREW and CRCW PRAM models.
- Theoretical bounds on the number of boundary arcs and implications for optimality.
Ideal for readers who want to understand fast parallel solutions to geometric problems and their practical implications in computational geometry.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for 0 (Logn) Parallel Time Intersection and Union Algorithms...
Seller Image
0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book focuses on a set of parallel algorithms which serve to address the intersection or union queries of many planar discs in a given plane. The algorithms within are designed for a parallel computation and feature reduced time complexities making them an efficient choice for processing large datasets. The efficient use of computer resources and the unique characterisation of the boundaries makes this book stand out as an authoritative guide on the subject matter. 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. Seller Inventory # 9781334216763_0
Buy New
US$ 17.09
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
0 Logn Parallel Time Intersection and Union Algorithms for a Set of Planar Disc Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781334216763
Buy New
US$ 24.09
US$ 4.50 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available
Stock Image
0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc (Classic Reprint)
Print on DemandSeller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 28 pages. 9.02x5.98x0.05 inches. This item is printed on demand. Seller Inventory # zk1334216762
Buy New
US$ 23.94
US$ 13.69 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available