Loading...
research article
A simple heuristic for the optimal enclosed area polygon problem
1996
We present a simple constructive heuristic for the optimal enclosed area polygon problem. Namely, given a finite set S of points in the plane, we look for the simple polygon with vertex set S having minimal, respectively maximal, enclosed area.
Type
research article
Authors
Publication date
1996
Published in
Volume
4
Issue
2-3
Start page
155
End page
166
Note
PRO 96.13
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
February 13, 2006
Use this identifier to reference this record