Bottleneck convex subsets: finding \(k\) large convex sets in a point set
From MaRDI portal
Publication:2695286
DOI10.1007/978-3-030-89543-3_17OpenAlexW3208423087MaRDI QIDQ2695286
Saeed Mehrabi, J. Mark Keil, Debajyoti Mondal, Stephane Durocher
Publication date: 30 March 2023
Full work available at URL: https://arxiv.org/abs/2108.12464
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a class of \(O(n^2)\) problems in computational geometry
- Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
- Topologically sweeping an arrangement
- Finding minimum area \(k\)-gons
- Iterated nearest neighbors and finding minimal polytopes
- On the complexity of locating linear facilities in the plane
- On a partition into convex polygons
- Ramsey-remainder
- Maximum rectilinear convex subsets
- On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3
- On the Hardness of Point-Set Embeddability
- The Ultimate Planar Convex Hull Algorithm?
- The Erdos-Szekeres problem on points in convex position – a survey
- Forbidden Configurations in Discrete Geometry
- Discrete and Computational Geometry
- Ramsey-remainder for convex sets and the Erdős-Szekeres theorem
This page was built for publication: Bottleneck convex subsets: finding \(k\) large convex sets in a point set
