2026-07-21T12:57:59Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:24491 2025-12-16T13:59:53Z ddc:004 open_access

Computing Largest Subsets of Points Whose Convex Hulls Have Bounded Area and Diameter Picarella, Gianmarco van Kreveld, Marc Staals, Frank de Vries, Sjoerd convex polygon dynamic programming implementation 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(n⁶k) time and O(n³k) 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(n³k) 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Gianmarco Picarella and Marc van Kreveld and Frank Staals and Sjoerd de Vries 2025 Is Part Of LIPIcs, Volume 351, 33rd Annual European Symposium on Algorithms (ESA 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ESA.2025.23 urn:nbn:de:0030-drops-244919 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.23 eng https://creativecommons.org/licenses/by/4.0/legalcode