𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithm for transversal of disjoint convex polygons

✍ Scribed by Francis Y.L. Chin; Fu Lee Wang

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
103 KB
Volume
83
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

✦ Synopsis

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 k i is the total number of vertices of the polygons.

πŸ“œ SIMILAR VOLUMES

Transversal of disjoint convex polygons
Transversal of disjoint convex polygons
✍ Francis Y.L. Chin; Hong Shen; Fu Lee Wang πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 146 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 find, if there exists one, 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 k i

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.