Finding Maximum Convex Polygons

@inproceedings{Fischer1993FindingMC,
  title={Finding Maximum Convex Polygons},
  author={Paul Fischer},
  booktitle={FCT},
  year={1993}
}
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… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-6 OF 6 CITATIONS

Optimal space coverage with white convex polygons

VIEW 8 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

White Space Regions

VIEW 8 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

EIRIS - An Extended Proposition Using Modified Occupancy Grid Map and Proper Seeding

  • 2018 International Conference on Indoor Positioning and Indoor Navigation (IPIN)
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND