Computing largest subsets of points whose convex hulls have bounded area and diameter

DOI10.4230/LIPICS.ESA.2025.23MaRDI QIDQ7322412zbMATH OpenFDO

Authors Gianmarco Picarella, Marc Van Kreveld, Frank Staals, Sjoerd de Vries

Publication date 31 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2025.23

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Fast algorithms for computing the smallest \(k\)-enclosing circle
• Finding k points with minimum diameter and related problems
• Finding minimum area \(k\)-gons
• Geometric Knapsack problems
• scientific article; zbMATH DE number 742951 (Why is no real title available?)
• Smallest \(k\)-enclosing rectangle revisited

This page was built for publication: Computing largest subsets of points whose convex hulls have bounded area and diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322412)