On maximum area polygons in a planar point set
From MaRDI portal
Publication:952010
DOI10.4171/EM/91zbMATH Open1154.52002OpenAlexW2059026683MaRDI QIDQ952010FDOQ952010
Publication date: 5 November 2008
Published in: Elemente der Mathematik (Search for Journal in Brave)
Full work available at URL: http://www.ems-ph.org/journals/show_pdf.php?issn=0013-6018&vol=63&iss=2&rank=3
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 (8)
- On the maximum area pentagon in a planar point set
- Inapproximability of finding maximum hidden sets on polygons and terrains
- Covering points with minimum/maximum area orthogonally convex polygons
- On the maximum area of inscribed polygons
- The maximum size of a convex polygon in a restricted set of points in the plane
- An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest
- Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
- Largest polygons with vertices in a given finite set
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)