On the Budgeted Hausdorff Distance Problem
DOI:
https://doi.org/10.57717/cgt.v4i2.57Abstract
Given a set P of n points in the plane, and a parameter k, we present an algorithm, whose running time is O(n3/2 √k log3/2n + kn log2n), with high probability, that computes a subset Q* of P of k points, that minimizes the Hausdorff distance between the convex-hulls of Q* and P . This is the first subquadratic algorithm for this problem if k is small.
Downloads
Published
Issue
Section
Categories
License
Copyright (c) 2025 Sariel Har-Peled, Benjamin Raichel
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
