A note on lower bounds for the maximum area and maximum perimeter k-gon problems

DOI10.1016/0020-0190(89)90022-7zbMath0677.68037OpenAlexW2082832869MaRDI QIDQ1123609

Robert L. III Drysdale, Jerzy W. Jaromczyk

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90022-7

zbMATH Keywords

isoperimetric problemslower boundscomputational geometrycomputational tree model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)

Related Items (3)

All-maximum and all-minimum problems under some measures ⋮ Empty squares in arbitrary orientation among points ⋮ Largest and smallest area triangles on imprecise points

Cites Work

• Unnamed Item
• Geometric applications of a matrix-searching algorithm
• Finding Extremal Polygons

This page was built for publication: A note on lower bounds for the maximum area and maximum perimeter k-gon problems