Cover Image

Computing Largest Subsets of Points Whose Convex Hulls have Bounded Area and Diameter

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Picarella, Gianmarco, van Kreveld, Marc, Staals, Frank, de Vries, Sjoerd
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon
by: van der Horst, Thijs, et al.
Published: (2025)

A near-linear time exact algorithm for the $L_1$-geodesic Fréchet distance between two curves on the boundary of a simple polygon
by: van der Horst, Thijs, et al.
Published: (2025)

Faster Fréchet Distance Approximation through Truncated Smoothing
by: van der Horst, Thijs, et al.
Published: (2024)

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
by: Buchin, Kevin, et al.
Published: (2026)

Robust Bichromatic Classification using Two Lines
by: Glazenburg, Erwin, et al.
Published: (2024)

Unfolding Polycubes with Orthogonally Convex Layers
by: Damian, Mirela, et al.
Published: (2024)

Multi-Covering a Point Set by $m$ Disks with Minimum Total Area
by: Guitouni, Mariem, et al.
Published: (2025)

Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
by: Damian, Mirela, et al.
Published: (2003)

Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters
by: Feng, Zhidan, et al.
Published: (2024)

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
by: Grandoni, Fabrizio, et al.
Published: (2024)

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
by: de Berg, Mark, et al.
Published: (2026)

Minimum-Length Coordinated Motions For Two Convex Centrally-Symmetric Robots
by: Kirkpatrick, David, et al.
Published: (2025)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
by: Jansson, Jesper, et al.
Published: (2024)

Better Sampling Bounds for Restricted Delaunay Triangulations and a Star-Shaped Property for Restricted Voronoi Cells
by: Shewchuk, Jonathan Richard
Published: (2026)

Faster, Deterministic and Space Efficient Subtrajectory Clustering
by: van der Hoog, Ivor, et al.
Published: (2024)

Skeletal Cut Loci on Convex Polyhedra
by: O'Rourke, Joseph, et al.
Published: (2023)

Drainability and Fillability of Polyominoes in Diverse Models of Global Control
by: Fekete, Sándor P., et al.
Published: (2025)

The Tight Spanning Ratio of the Rectangle Delaunay Triangulation
by: van Renssen, Andrè, et al.
Published: (2022)

On the Diameter of Arrangements of Topological Disks
by: Abiad, Aida, et al.
Published: (2025)

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb{R}^2$
by: Aronov, Boris, et al.
Published: (2024)

Drawing Reeb Graphs
by: Chambers, Erin, et al.
Published: (2025)

General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
by: Charvy, Gaspard, et al.
Published: (2025)

Drone Air Traffic Control: Tracking a Set of Moving Objects with Minimal Power
by: Loi, Chek-Manh, et al.
Published: (2026)

Approximating Euclidean Shallow-Light Trees
by: Le, Hung, et al.
Published: (2025)

Online Competitive Searching for Rays in the Half-plane
by: Langetepe, Elmar, et al.
Published: (2025)

Dispersive Vertex Guarding for Simple and Non-Simple Polygons
by: Fekete, Sándor P., et al.
Published: (2024)

Evolving Distributions Under Local Motion
by: Acharya, Aditya, et al.
Published: (2024)

Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform External Forces
by: Becker, Aaron T., et al.
Published: (2024)

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
by: Fekete, Sándor P., et al.
Published: (2024)

Super Guarding and Dark Rays in Art Galleries
by: MIT CompGeom Group, et al.
Published: (2024)

Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings)
by: Wulf, Lasse
Published: (2025)

The Spanning Ratio of the Directed $Θ_6$-Graph is 5
by: Bose, Prosenjit, et al.
Published: (2026)

Deltahedral Domes over Equiangular Polygons
by: MIT CompGeom Group, et al.
Published: (2024)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
by: Le, Hung, et al.
Published: (2023)

Map-Matching Queries under Fréchet Distance on Low-Density Spanners
by: Buchin, Kevin, et al.
Published: (2024)

Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
by: Emmerich, Michael
Published: (2025)

Separated Variables on Plane Algebraic Curves
by: Buchacher, Manfred
Published: (2024)

Structure and Independence in Hyperbolic Uniform Disk Graphs
by: Bläsius, Thomas, et al.
Published: (2024)

Convex pentagonal monotiles in the 15 Type families
by: Sugimoto, Teruhisa
Published: (2025)

Ortho-unit polygons can be guarded with at most $\lfloor \frac{n-4}{8} \rfloor$ guards
by: Díaz-Báñez, J. M., et al.
Published: (2022)