Efficient algorithm for transversal of disjoint convex polygons.

DOI10.1016/S0020-0190(01)00322-2zbMath1043.68102MaRDI QIDQ1853055

Francis Y. L. Chin, Fu Lee Wang

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Computational geometryStabberTransversalDisjoint convex polygon

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Some Discrete Properties of the Space of Line Transversals to Disjoint Balls

Cites Work

• Finding transversals for sets of simple geometric figures
• Stabbing line segments
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Linear Programming in Linear Time When the Dimension Is Fixed

This page was built for publication: Efficient algorithm for transversal of disjoint convex polygons.