Infoscience

Journal article

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.

    Note:

    PRO 96.13

    Reference

    • ROSO-ARTICLE-1996-005

    Record created on 2006-02-13, modified on 2016-08-08

Fulltext

  • There is no available fulltext. Please contact the lab or the authors.

Related material