0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc (Classic Reprint) - Brossura
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per 0 (Logn) Parallel Time Intersection and Union Algorithms...
Immagini fornite dal venditore
0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar
Print on DemandDa: Forgotten Books, London, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9781334216763_0
Compra nuovo
EUR 15,12
Spedizione gratuita
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
0 Logn Parallel Time Intersection and Union Algorithms for a Set of Planar Disc Classic Reprint
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781334216763
Compra nuovo
EUR 21,45
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 15 disponibili
Foto dell'editore
0 Logn Parallel Time Intersection and Union Algorithms for a Set of Planar Disc Classic Reprint
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 4 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781334216763
Compra nuovo
EUR 20,58
Spedizione EUR 3,80
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 15 disponibili