On maximum area polygons in a planar point set
From MaRDI portal
Recommendations
- More on the maximum area polygons in a planar point set
- On the maximum area pentagon in a planar point set
- Combinatorial Geometry and Graph Theory
- On an empty triangle with the maximum area in planar point sets
- The maximum size of a convex polygon in a restricted set of points in the plane
- Covering points with minimum/maximum area orthogonally convex polygons
- On the maximum area of inscribed polygons
- An empirical study on randomized optimal area polygonization of planar point sets
- scientific article; zbMATH DE number 881170
- Polygonizations of point sets in the plane
Cites work
Cited in
(9)- Largest polygons with vertices in a given finite set
- Inapproximability of finding maximum hidden sets on polygons and terrains
- Covering points with minimum/maximum area orthogonally convex polygons
- An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest
- On the maximum area pentagon in a planar point set
- Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
- More on the maximum area polygons in a planar point set
- The maximum size of a convex polygon in a restricted set of points in the plane
- On the maximum area of inscribed polygons
This page was built for publication: On maximum area polygons in a planar point set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952010)
