Finding minimum area simple pentagons

0.00 Avg rating—0 Votes

Article ID:	iaor2002929
Country:	Netherlands
Volume:	21
Issue:	5
Start Page Number:	229
End Page Number:	233
Publication Date:	Dec 1997
Journal:	Operations Research Letters
Authors:	Liebling Thomas M., Hche Jean-Franois
Keywords:	geometry

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.

Reviews

Required fields are marked *. Your email address will not be published.