Very Fast Algorithms for the Area of the Union of Many Circles Classic Reprint
Paul G. Spirakis
ISBN 10: 1333725426 ISBN 13: 9781333725426
Verlag: Forgotten Books, 2018
Neu
PAP
Verkäufer
PBShop.store US, Wood Dale, IL, USA
Verkäuferbewertung 5 von 5 Sternen
AbeBooks-Verkäufer seit 7. April 2005
Dieser Artikel ist nicht mehr verfügbar.
Beschreibung
Beschreibung:
New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781333725426
Inhaltsangabe:
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Bibliografische Details
Titel: Very Fast Algorithms for the Area of the ...
Verlag: Forgotten Books
Erscheinungsdatum: 2018
Einband: PAP
Zustand: New
Beste Suchergebnisse bei AbeBooks
Very Fast Algorithms for the Area of the Union of Many Circles
Print-on-DemandAnbieter: Forgotten Books, London, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: 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. Bestandsnummer des Verkäufers 9781333725426_0
Neu kaufen
EUR 15,37
Versand gratis
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Very Fast Algorithms for the Area of the Union of Many Circles Classic Reprint
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781333725426
Neu kaufen
EUR 20,52
EUR 3,78 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 15 verfügbar