COMPUTING SHORTEST TRANSVERSALS OF SETS
From MaRDI portal
Publication:3136222
DOI10.1142/S0218195992000238zbMath0776.68105MaRDI QIDQ3136222
Jurek Czyzowicz, Ivan Stojmenović, Peter Egyed, Binay K. Bhattacharya, Jorge Urrutia, Godfried T. Toussaint
Publication date: 26 November 1993
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Optimal algorithms for some intersection radius problems ⋮ Stabbing segments with rectilinear objects ⋮ Stabbers of line segments in the plane ⋮ Some Discrete Properties of the Space of Line Transversals to Disjoint Balls ⋮ A near-linear algorithm for the planar segment-center problem
