Finding minimum area simple pentagons

Authors:
Jean-FrançOis HêChe;Thomas M. Liebling
Affiliations:
Department of Mathematics, Swiss Federal Institute of Technology, DMA-Ecublens, CH-1015 Lausanne, Switzerland;Department of Mathematics, Swiss Federal Institute of Technology, DMA-Ecublens, CH-1015 Lausanne, Switzerland
Venue:
Operations Research Letters
Year:
1997

Citing 5
Cited 0

Topologically sweeping an arrangement

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
Searching for empty convex polygons

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
New algorithms for minimum area k-gons

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Finding minimum area k-gons

Discrete & Computational Geometry

Quantified Score

Hi-index	0.00

Visualization

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.