Article ID: | iaor2009603 |
Country: | Germany |
Volume: | 4 |
Issue: | 2/3 |
Start Page Number: | 155 |
End Page Number: | 166 |
Publication Date: | Jan 1996 |
Journal: | Central European Journal of Operations Research |
Authors: | Liebling Thomas M., Hche Jean-Franois |
Keywords: | sets, combinatorial optimization |
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.