Loading...
research article
Finding minimum area simple pentagons
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.
Type
research article
Web of Science ID
WOS:000074049000004
Authors
Publication date
1997
Published in
Volume
21
Issue
5
Start page
229
End page
233
Note
PRO 97.07
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
February 13, 2006
Use this identifier to reference this record