Largest polygons with vertices in a given finite set

DOI10.1016/0166-218X(86)90029-6zbMath0607.52003OpenAlexW1989752150MaRDI QIDQ1085439

Craig M. Cordes, K. Brooks Reid

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(86)90029-6

zbMATH Keywords

k-gon of maximum area with vertices in a given finite set

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (2) dimensions (including convex curves) (52A10) Polytopes and polyhedra (52Bxx)

Related Items (1)

Linear algorithm to find the largest intriangles of a planar convex polygon

Cites Work

• Arcwise Convex Sets

This page was built for publication: Largest polygons with vertices in a given finite set