๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximating centroids for the maximum intersection of spherical polygons

โœ Scribed by Jong-Sung Ha; Kwan-Hee Yoo

Book ID
104006276
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
229 KB
Volume
37
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

โœฆ Synopsis

This paper considers the problem of investigating the spherical regions owned by the maximum number of spherical polygons. We present a practical O(n(vCI)) time algorithm for finding the approximating centroids for the maximum intersection of spherical polygons, where n, v, and I are, respectively, the numbers of polygons, all vertices, and intersection points. In order to elude topological errors and handle geometric degeneracies, our algorithm takes the approach of edge-based partitioning of the sphere. Furthermore, the numerical complexity is avoided since the algorithm is completely spherical.

๐Ÿ“œ SIMILAR VOLUMES

An Optimal Algorithm for the Intersectio
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
โœ Shreesh Jadhav; Asish Mukhopadhyay; Binay Bhattacharya ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 224 KB

The intersection radius of a finite collection of geometrical objects in the plane is the radius of the smallest closed disk that intersects all the objects in the collection. Bhattacharya et al. showed how the intersection radius can be found in linear time for a collection of line segments in the