Items related to 0 (Logn) Parallel Time Intersection and Union Algorithms...
0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc (Classic Reprint) - Softcover
Synopsis
Excerpt from 0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc
Related problems, such as estimating the area of the union of many discs in the plane, were first posed by [shamos, monte-carlo techniques for computing the volume of the union of n spheres in k dimensions were given in [spirakis, They run in time O(nk) and are based on a method developed by [karp, Luby, 83] for estimation of the failure probability of an n component system. Also, [sharir, 83] shows how to construct the Voronoi diagram of a set of n circular bodies, in time O(nlog2n)
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"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
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 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781334216763
Quantity: 15 available
Stock Image
0 Logn Parallel Time Intersection and Union Algorithms for a Set of Planar Disc Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781334216763
Quantity: 15 available
Stock Image
0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc (Classic Reprint)
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 28 pages. 9.02x5.98x0.05 inches. In Stock. Seller Inventory # __1334216762
Quantity: 1 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
Quantity: 1 available