Covering points with orthogonally convex polygons

DOI10.1016/j.comgeo.2010.12.001zbMath1217.52010OpenAlexW2005150014MaRDI QIDQ543785

Brahim Hnich, Cem Evrendilek, Burkay Genç

Publication date: 17 June 2011

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

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

zbMATH Keywords

reconstructioncovering a point setorthogonally convex polygons

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Geometric separability using orthogonal objects ⋮ Covering points with minimum/maximum area orthogonally convex polygons ⋮ Covering points with orthogonal polygons

Cites Work

• On the definition and computation of rectilinear convex hulls
• Orthogonal polygon reconstruction from stabbing information
• Connected Rectilinear Graphs on Point Sets
• Reconstructing Polygons from Scanner Data
• Unnamed Item

This page was built for publication: Covering points with orthogonally convex polygons