On the Budgeted Hausdorff Distance Problem

06/03/2023

∙

by   Sariel Har-Peled, et al.

∙

0

∙

share

Given a set P of n points in the plane, and a parameter k, we present an algorithm, whose running time is , with high probability, that computes a subset ⊆ P of k points, that minimizes the Hausdorff distance between the convex-hulls of and P. This is the first subquadratic algorithm for this problem if k is small.