Evrendilek C.Genç B.Hnich B.2023-06-162023-06-1620101571-0653https://doi.org/10.1016/j.endm.2010.05.039https://hdl.handle.net/20.500.14365/3444We address the problem of covering points with orthogonal polygons. Specifically, given a set of n grid-points in the plane each designated in advance with either a horizontal or vertical reading, we investigate the existence of an orthogonal polygon covering these n points in such a way that each edge of the polygon covers exactly one point and each point is covered by exactly one edge with the additional requirement that the reading associated with each point dictates whether the edge covering it is to be horizontal or vertical. We show that this problem is NP-complete. © 2010 Elsevier B.V.eninfo:eu-repo/semantics/closedAccessComputational geometryCoveringNP-completeOrthogonal polygonArticle10.1016/j.endm.2010.05.0392-s2.0-77954913452