Partitioning a planar point set into empty convex polygons
From MaRDI portal
Publication:5897095
Recommendations
Cited in
(16)- Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
- On the minimum number of mutually disjoint holes in planar point sets
- Recognition of largest empty orthoconvex polygon in a point set
- The \(n\)-point and six-partite point of a convex polygon
- More on empty convex quadrilaterals in a planar point set
- Disjoint empty convex polygons in planar point sets
- Dispersing and grouping points on planar segments
- Partitioning point sets in space into disjoint convex polytopes
- Twenty years of progress of \(\mathrm{JCDCG}^3\)
- Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge)
- scientific article; zbMATH DE number 2073966 (Why is no real title available?)
- Problem of partitioning a planar point set into empty convex polygons
- On polygons enclosing point sets. II
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
- Bottleneck convex subsets: finding \(k\) large convex sets in a point set
- On the number of empty convex quadrilaterals of a finite set in the plane
This page was built for publication: Partitioning a planar point set into empty convex polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897095)