Verwandte Artikel zu Very Fast Algorithms for the Area of the Union of Many...

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

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

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

Excerpt from Very Fast Algorithms for the Area of the Union of Many Circles

The problem of estimating the area of the union of many circles in the plane was first posed by [shamos, We present here an 0(n2) deterministic and an o(u) probabilistic algorithm for solving the problem. The recent work of [karp, Luby, 83] on estimating the failure probability of an n-component system helped us a lot in stating the algorithm and formulating the proof of fast convergence. The probabilistic algorithm can be modified to compute the area of the union of other planar objects (of fixed description) e.g. Triangles or boxes. The time is again o(u). The algorithm can also be extended to compute the volume of the union of n spheres in k dimensions, in time 0(nk). The algorithm has similar time complexity for k-dimensional objects other than spheres, provided that each object has a fixed description (not dependent on n).

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Gratis für den Versand von Vereinigtes Königreich nach USA

Versandziele, Kosten & Dauer

Weitere beliebte Ausgaben desselben Titels

Suchergebnisse für Very Fast Algorithms for the Area of the Union of Many...

Foto des Verkäufers

Paul G. Spirakis
Verlag: Forgotten Books, 2018
ISBN 10: 1333725426 ISBN 13: 9781333725426
Neu Paperback
Print-on-Demand

Anbieter: Forgotten Books, London, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

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

Verkäufer kontaktieren

Neu kaufen

EUR 15,27
Währung umrechnen
Versand: Gratis
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Paul G. Spirakis
Verlag: Forgotten Books, 2018
ISBN 10: 1333725426 ISBN 13: 9781333725426
Neu PAP

Anbieter: PBShop.store US, Wood Dale, IL, USA

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781333725426

Verkäufer kontaktieren

Neu kaufen

EUR 18,81
Währung umrechnen
Versand: Gratis
Innerhalb der USA
Versandziele, Kosten & Dauer

Anzahl: 15 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Paul G. Spirakis
Verlag: Forgotten Books, 2018
ISBN 10: 1333725426 ISBN 13: 9781333725426
Neu PAP

Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781333725426

Verkäufer kontaktieren

Neu kaufen

EUR 17,78
Währung umrechnen
Versand: EUR 3,77
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer

Anzahl: 15 verfügbar

In den Warenkorb