Abstract
Given a set P of n points in the plane, we want to find a simple, not necessarily convex, pentagon Q with vertices in P of minimum area. We present an algorithm for solving this problem in time O(nT(n)) and space O(n) , where T(n) is the number of empty triangles in the set.
Details
Title
Finding minimum area simple pentagons
Author(s)
Hêche, Jean-François ; Liebling, Thomas M.
Published in
Operations Research Letters
Volume
21
Issue
5
Pages
229-233
Date
1997
Keywords
Note
PRO 97.07
Other identifier(s)
View record in Web of Science
Laboratories
ROSO
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > SB Archives > ROSO - Chair of Operations Research SO
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date
2006-02-13