Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
From MaRDI portal
Publication:6173215
DOI10.1142/s0218195922410035OpenAlexW3197202594MaRDI QIDQ6173215
Debajyoti Mondal, J. Mark Keil, Stephane Durocher, Saeed Mehrabi
Publication date: 21 July 2023
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195922410035
Cites Work
- 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
- Bottleneck convex subsets: finding \(k\) large convex sets in a point set
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
