0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar

Language: English

Published by Forgotten Books, London, 2018

1334216762 / 9781334216763

  • Softcover
  • New
See all details
Item image 1 of 2.

Seller: Forgotten Books, London, United KingdomForgotten Books

5-star seller

AbeBooks seller since June 2, 2021

Softcover

Condition: New

US$ 17.09

 Free Shipping 
Ships from United Kingdom to U.S.A.

Quantity: Over 20 available

Add to basket
Free 30-day returns

Item description from seller

Print on Demand. 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. 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.…

Title
0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar
Author
T. S. Papatheodoro, P. G. Spirakis
Publisher
Forgotten Books, London
Publication year
2018
Condition
New
Dust jacket
No Jacket
Book Type
print-on-demand item
Binding
Paperback
Language
English
ISBN 10
1334216762
ISBN 13
9781334216763
Dimensions
5.98 x 0.25 x 9.02 inches
Seller catalogs
Geometry

Forgotten Books

London, United Kingdom

5-star seller

AbeBooks seller since June 2, 2021

Shipping rates from United Kingdom to U.S.A.

Item5 to 10 business days5 to 10 business days
First itemUS$ 0.00US$ 0.00
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay

Store description

Forgotten Books’ Classic Reprint Series utilizes the latest technology to regenerate facsimiles of historically important writings. Careful attention has been made to accurately preserve the original format of each page whilst digitally enhancing the quality of the aged text.

Specialty

Trade

Seller's business information

FB &c Ltd

Dalton House, 60 Windsor Avenue
London, United Kingdom SW19 2RR