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

A new linear algorithm for intersecting convex polygons

โœ Scribed by Joseph O'Rourke; Chi-Bin Chien; Thomas Olson; David Naddor

Publisher
Elsevier Science
Year
1982
Weight
82 KB
Volume
19
Category
Article
ISSN
0146-664X

No coin nor oath required. For personal study only.

๐Ÿ“œ 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