Efficient algorithm for transversal of disjoint convex polygons.

DOI10.1016/S0020-0190(01)00322-2MaRDI QIDQ1853055zbMATH OpenFDO

Authors 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

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

Recommendations

• Transversal of disjoint convex polygons.
• scientific article; zbMATH DE number 3990242
• MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
• Finding transversals for sets of simple geometric figures
• COMPUTING SHORTEST TRANSVERSALS OF SETS

Cites work

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

Cited in

(5)

• Transversal of disjoint convex polygons.
• TRANSVERSALS OF FAMILIES OF SETS IN $ \mathbb{R}^n$ AND A CONNECTION BETWEEN THE HELLY AND BORSUK THEOREMS
• scientific article; zbMATH DE number 3990242 (Why is no real title available?)
• Some discrete properties of the space of line transversals to disjoint balls
• Efficient regular polygon dissections

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853055)