Finding minimum area simple pentagons

DOI10.1016/S0167-6377(97)00051-5zbMath0908.90212WikidataQ127359179 ScholiaQ127359179MaRDI QIDQ1267196

Thomas M. Liebling, Jean-François Hêche

Publication date: 6 October 1998

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

polynomial algorithmsminimum areapentagon

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

On rainbow quadrilaterals in colored point sets

Cites Work

• Searching for empty convex polygons
• Topologically sweeping an arrangement
• Finding minimum area \(k\)-gons
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding minimum area simple pentagons