Hêche, J.-F.Liebling, Th. M.2006-02-132006-02-132006-02-131996https://infoscience.epfl.ch/handle/20.500.14299/222805We 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.text::journal::journal article::research article