Items related to Very Fast Algorithms for the Area of the Union of Many...
Synopsis
This book presents two novel algorithms for calculating the combined area of a group of circles on a two-dimensional plane. The first algorithm, deterministic in nature, has an algorithmic complexity of 0(n2), where n denotes the number of circles. The second algorithm is probabilistic, with a complexity of o(n), making it more efficient for larger sets of circles. The author employs recent developments in the field of reliability estimation to establish the fast convergence of the probabilistic method and extends the algorithm to calculate the volume of n-dimensional spheres with complexity 0(nk). The author situates this work within the broader discourse on estimating the area of unions of geometric shapes, providing a valuable resource for researchers and practitioners in computer science and related fields.
"synopsis" may belong to another edition of this title.
Buy New
View this item
US$ 17.42
FREE shipping from United Kingdom to U.S.A.
Destination, rates & speedsOther Popular Editions of the Same Title
Search results for Very Fast Algorithms for the Area of the Union of Many...
Seller Image
Very Fast Algorithms for the Area of the Union of Many Circles
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book presents two novel algorithms for calculating the combined area of a group of circles on a two-dimensional plane. The first algorithm, deterministic in nature, has an algorithmic complexity of 0(n2), where n denotes the number of circles. The second algorithm is probabilistic, with a complexity of o(n), making it more efficient for larger sets of circles. The author employs recent developments in the field of reliability estimation to establish the fast convergence of the probabilistic method and extends the algorithm to calculate the volume of n-dimensional spheres with complexity 0(nk). The author situates this work within the broader discourse on estimating the area of unions of geometric shapes, providing a valuable resource for researchers and practitioners in computer science and related fields. 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 # 9781333725426_0
Quantity: Over 20 available
Stock Image
Very Fast Algorithms for the Area of the Union of Many Circles 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 # LW-9781333725426
Quantity: 15 available
Stock Image
Very Fast Algorithms for the Area of the Union of Many Circles 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 # LW-9781333725426
Quantity: 15 available