Finding Maximum Convex Polygons

  title={Finding Maximum Convex Polygons},
  author={P. Fischer},
  • P. Fischer
  • Published in FCT 1993
  • Mathematics, Computer Science
This paper considers the situation where one is given a finite set of n points in the plane each of which is labeled either “positive” or “negative”. The problem is to find a bounded convex polygon of maximum area, the vertices of which are positive points and which does not contain any negative point. It is shown that this problem can be solved in time O(n4 log n). Instead of using the area as the quantity to be maximized one may also use other measures fulfilling a certain additive property… Expand
Sequential and Parallel Algorithms for Finding a Maximum Convex Polygon
  • P. Fischer
  • Computer Science, Mathematics
  • Comput. Geom.
  • 1997
Optimal space coverage with white convex polygons
More or less efficient agnostic learning of convex polygons
  • P. Fischer
  • Mathematics, Computer Science
  • COLT '95
  • 1995
EIRIS - An Extended Proposition Using Modified Occupancy Grid Map and Proper Seeding
White Space Regions
Trial and error


Computing the Largest Empty Rectangle
Finding minimum areak-gons
Minimum Polygonal Separation
Fast algorithms for computing the largest empty rectangle