Covering points with orthogonally convex polygons

DOI10.1016/J.COMGEO.2010.12.001zbMATH Open1217.52010OpenAlexW2005150014MaRDI QIDQ543785FDOQ543785

Authors: Burkay Genç, Cem Evrendilek, Brahim Hnich 

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

Recommendations

• Covering points with minimum/maximum area orthogonally convex polygons
• Covering points with orthogonal polygons
• Orthogonally convex covering of orthogonal polygons without holes
• Covering oriented points in the plane with orthogonal polygons is NP-complete
• On covering orthogonal polygons with star-shaped polygons

zbMATH Keywords

reconstructioncovering a point setorthogonally convex polygons

Mathematics Subject Classification ID

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

Cites Work

• On the definition and computation of rectilinear convex hulls
• Connected Rectilinear Graphs on Point Sets
• Title not available (Why is that?)
• Orthogonal polygon reconstruction from stabbing information
• Reconstructing polygons from scanner data

Cited In (8)

• Covering convex sets with non-overlapping polygons
• Orthogonally convex covering of orthogonal polygons without holes
• Covering points with minimum/maximum area orthogonally convex polygons
• Covering points with orthogonal polygons
• Covering a simple polygon by monotone directions
• Geometric separability using orthogonal objects
• On point covers of \(c-\)oriented polygons
• Covering orthogonal polygons with star polygons: The perfect graph approach

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q543785)