Covering points with minimum/maximum area orthogonally convex polygons

DOI10.1016/J.COMGEO.2016.02.003zbMath1338.65057OpenAlexW2278044688MaRDI QIDQ283887

Brahim Hnich, Burkay Genç, Cem Evrendilek

Publication date: 17 May 2016

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2016.02.003

zbMATH Keywords

algorithmnumerical exampledynamic programmingorthogonally convexoptimal areapolygon cover

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Cites Work

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

This page was built for publication: Covering points with minimum/maximum area orthogonally convex polygons