On disjoint holes in point sets
From MaRDI portal
Publication:6621264
Publication date: 18 October 2024
Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Konvexe Fünfecke in ebenen Punktmengen
- Finding sets of points without empty convex 6-gons
- Disjoint empty convex pentagons in planar point sets
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- The empty hexagon theorem
- Empty convex hexagons in planar point sets
- A combinatorial problem in geometry.
- Multidimensional Sorting
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Computer solution to the 17-point Erdős-Szekeres problem
- Sets with No Empty Convex 7-Gons
- A superlinear lower bound on the number of 5-holes
- Specified holes with pairwise disjoint interiors in planar point sets
- On the Erdős-Szekeres convex polygon problem
- A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets
- On the minimum size of a point set containing a 5-hole and a disjoint 4-hole
- On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons
- Sweeps, arrangements and signotopes
- On the number of disjoint convex quadrilaterals for a planar point set
This page was built for publication: On disjoint holes in point sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621264)
