Very Fast Algorithms for the Area of the Union of Many Circles (Classic Reprint) - Softcover

Spirakis, Paul G.

 
9781333725426: Very Fast Algorithms for the Area of the Union of Many Circles (Classic Reprint)

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.

Other Popular Editions of the Same Title