Finding Minimum Area k-gons

  title={Finding Minimum Area k-gons},
  author={David Eppstein and Mark H. Overmars and G{\"u}nter Rote and Gerhard J. Woeginger},
  journal={Discrete & Computational Geometry},
Given a set P of n points in the plane and a number k, we want to find a polygon C with vertices in P of minimum area that satisfies one of the following properties: (1) C is a convex k-gon, (2) C is an empty convex k-gon, or (3) C is the convex hull of exactly k points of P . We give algorithms for solving each of these three problems in time O(kn3). The space complexity is O(n) for k = 4 and O(kn2) for k ≥ 5. The algorithms are based on a dynamic programming approach. We generalize this… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 42 extracted citations

Computing Phylogenetic Diversity for Split Systems

IEEE/ACM Transactions on Computational Biology and Bioinformatics • 2008
View 6 Excerpts
Highly Influenced

Convex polygons in geometric triangulations

Combinatorics, Probability & Computing • 2017
View 2 Excerpts


Publications referenced by this paper.
Showing 1-10 of 14 references

Computational geometry

A. Aggarwal, J. Wein
Lecture notes for 18.409, MIT Laboratory for Computer Science • 1988
View 1 Excerpt

Algorithms in Combinatorial Geometry

EATCS Monographs in Theoretical Computer Science • 1987


H. Edelsbrunner
O’Rourke and R. Seidel, Constructing arrangements of lines and hyperplanes with applications, SIAM J. Computing 15 • 1986
View 2 Excerpts

Computing the largest empty convex subset of a set of points

Symposium on Computational Geometry • 1985
View 1 Excerpt

Similar Papers

Loading similar papers…