Efficient algorithm for transversal of disjoint convex polygons

  • Authors:

  • Francis Y. L. Chin;Fu Lee Wang

  • Affiliations:

  • Department of Computer Science and Information Systems, The University of Hong Kong, Hong Kong;Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Hong Kong

  • Venue:
  • Information Processing Letters
  • Year:
  • 2002

Quantified Score

Hi-index 0.89

Visualization

Abstract

Given a set S of n disjoint convex polygons {Pi 1 ≤ i ≤ n} in a plane, each with ki 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 = Σi=1 nki is the total number of vertices of the polygons.