A Fully Polynomial Time Approximation Scheme for the Smallest Diameter of Imprecise Points
keywords: Computational Geometry, Data Imprecision
Journal Article (peer-reviewed)
Maarten Löffler, Vahideh Keikha
A Fully Polynomial Time Approximation Scheme for the Smallest Diameter of Imprecise Points
Theoretical Computer Science
814, 4, 2020
Workshop or Poster (weakly reviewed)
Maarten Löffler, Vahideh Keikha
A Fully Polynomial Time Approximation Scheme For the Smallest Diameter of Imprecise Points
Proc. 34th European Workshop on Computational Geometry
, 2018
back to list