Covering points with orthogonal polygons

DOI10.1016/j.dam.2012.01.018zbMath1321.05032OpenAlexW2046963656MaRDI QIDQ496708

Burkay Genç, Brahim Hnich, Cem Evrendilek

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.01.018

zbMATH Keywords

coveringNP-completenessorthogonal polygon

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Polytopes and polyhedra (52B99)

Related Items (1)

Covering points with minimum/maximum area orthogonally convex polygons

Cites Work

• Covering points with orthogonally convex polygons
• Reconstructing orthogonal polyhedra from putative vertex sets
• On the definition and computation of rectilinear convex hulls
• The complexity of detecting crossingfree configurations in the plane
• Covering oriented points in the plane with orthogonal polygons is NP-complete
• Connected Rectilinear Graphs on Point Sets
• Unnamed Item

This page was built for publication: Covering points with orthogonal polygons