Discrete & Computational Geometry

, Volume 29, Issue 1, pp 153–158

Finding Sets of Points without Empty Convex 6-Gons


  •  Mark Overmars
    • Department of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands markov@cs.uu.nl

DOI: 10.1007/s00454-002-2829-x

Cite this article as:
Mark Overmars Discrete Comput Geom (2002) 29: 153. doi:10.1007/s00454-002-2829-x

Abstract. Erdös asked whether every large enough set of points in general position in the plane contains six points that form a convex 6-gon without any points from the set in its interior. In this note we show how a set of 29 points was found that contains no empty convex 6-gon. To this end a fast incremental algorithm for finding such 6-gons was designed and implemented and a heuristic search approach was used to find promising sets. The experiments also led to two observations that might be useful in proving that large sets always contain an empty convex 6-gon.

Copyright information

© 2002 Springer-Verlag New York Inc.