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
https://doi.org/10.1016/j.tcs.2020.02.006

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
https://conference.imp.fu-berlin.de/eurocg18/download/paper_55.pdf

back to list