@inproceedings{605b0c42657a455a9376347a1c778de0,
title = "Computing Largest Subsets of Points Whose Convex Hulls Have Bounded Area and Diameter",
abstract = "We study the problem of computing a convex region with bounded area and diameter that contains the maximum number of points from a given point set P. We show that this problem can be solved in O(n6k) time and O(n3k) space, where n is the size of P and k is the maximum number of points in the found region. We experimentally compare this new algorithm with an existing algorithm that does the same but without the diameter constraint, which runs in O(n3k) time. For the new algorithm, we use different diameters. We use both synthetic data and data from an application in cancer detection, which motivated our research.",
keywords = "convex polygon, dynamic programming, implementation",
author = "Gianmarco Picarella and \{van Kreveld\}, Marc and Frank Staals and \{de Vries\}, Sjoerd",
note = "Publisher Copyright: {\textcopyright} Gianmarco Picarella, Marc van Kreveld, Frank Staals, and Sjoerd de Vries licensed under Creative Commons License CC-BY 4.0 33rd Annual European Symposium on Algorithms (ESA 2025).; 33rd Annual European Symposium on Algorithms, ESA 2025 ; Conference date: 15-09-2025 Through 17-09-2025",
year = "2025",
month = oct,
day = "1",
doi = "10.4230/LIPIcs.ESA.2025.23",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
editor = "Anne Benoit and Haim Kaplan and Sebastian Wild and Sebastian Wild and Grzegorz Herman",
booktitle = "33rd Annual European Symposium on Algorithms, ESA 2025",
}