COMPUTING SHORTEST TRANSVERSALS OF SETS

DOI10.1142/S0218195992000238zbMATH Open0776.68105MaRDI QIDQ3136222FDOQ3136222

Authors: Binay Bhattacharya, Jurek Czyzowicz, Peter Egyed, Godfried Toussaint, Ivan Stojmenović, J. Urrutia 

Publication date: 26 November 1993

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 176771
• The traveling salesmanpProblem for lines in the plane
• Computing shortest transversals
• Finding transversals for sets of simple geometric figures
• MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS

zbMATH Keywords

envelopebutterfly polygonshortest transversal

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (8)

• Stabbers of line segments in the plane
• Guarding precise and imprecise polyhedral terrains with segments
• Stabbing segments with rectilinear objects
• Title not available (Why is that?)
• A near-linear algorithm for the planar segment-center problem
• Optimal algorithms for some intersection radius problems
• Some discrete properties of the space of line transversals to disjoint balls
• Efficient algorithm for transversal of disjoint convex polygons.

This page was built for publication: COMPUTING SHORTEST TRANSVERSALS OF SETS

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