Covering points with orthogonally convex polygons

@article{Gen2011CoveringPW,
  title={Covering points with orthogonally convex polygons},
  author={Burkay Genç and Cem Evrendilek and Brahim Hnich},
  journal={Comput. Geom.},
  year={2011},
  volume={44},
  pages={249-264}
}
In this paper, we address the problem of covering points with orthogonally convex polygons. In particular, given a point set of size n on the plane, we aim at finding if there exists an orthogonally convex polygon such that each edge of the polygon covers exactly one point and each point is covered by exactly one edge. We show that if such a polygon exists, it may not be unique. We propose an O(nlogn) algorithm to construct such a polygon if it exists, or else report the non-existence in the… CONTINUE READING

Topics from this paper.

Citations

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

Covering points with minimum/maximum area orthogonally convex polygons

VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Covering oriented points in the plane with orthogonal polygons is NP-complete

  • Electronic Notes in Discrete Mathematics
  • 2010
VIEW 2 EXCERPTS
CITES BACKGROUND

Similar Papers

Loading similar papers…