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

An Optimal Illumination Region Algorithm for Convex Polygons

โœ Scribed by Lee, D.T.; Silio, C.B., Jr.

Book ID
114606532
Publisher
IEEE
Year
1982
Tongue
English
Weight
691 KB
Volume
C-31
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An improved algorithm for intersecting c
An improved algorithm for intersecting convex polygons
โœ Youssef G. Saab ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 200 KB

A modification of a linear-time algorithm to compute the intersection of two convex polygons reduces the number of computational steps by almost half. @ 1997 Elsevier Science B.V.

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