A simple heuristic for the optimal enclosed area polygon problem

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.


Published in:
CEJORE, 4, 2-3, 155-166
Year:
1996
Note:
PRO 96.13
Laboratories:




 Record created 2006-02-13, last modified 2018-01-27


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)