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

An improved algorithm for intersecting convex polygons

โœ Scribed by Youssef G. Saab

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
200 KB
Volume
61
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

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

Efficient algorithm for transversal of d
Efficient algorithm for transversal of disjoint convex polygons
โœ Francis Y.L. Chin; Fu Lee Wang ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 103 KB

Given a set S of n disjoint convex polygons {P i | 1 i n} in a plane, each with k i vertices, the transversal problem is to determine whether there exists a straight line that goes through every polygon in S. We show that the transversal problem can be solved in O(N + n log n) time, where N = n i=1