Covering points with minimum/maximum area orthogonally convex polygons
DOI10.1016/J.COMGEO.2016.02.003zbMATH Open1338.65057OpenAlexW2278044688MaRDI QIDQ283887FDOQ283887
Authors: Cem Evrendilek, Burkay Genç, Brahim Hnich 
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
Recommendations
- Covering points with orthogonally convex polygons
- Covering points with orthogonal polygons
- Covering points with convex sets of minimum size
- Covering Points with Convex Sets of Minimum Size
- scientific article; zbMATH DE number 3872705
- Multi cover of a polygon minimizing the sum of areas
- Multi cover of a polygon minimizing the sum of areas
- Covering the convex quadrilaterals of point sets
- On maximum area polygons in a planar point set
- Covering Orthogonal Polygons with Non-Piercing Rectangles
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cites Work
- 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
- Title not available (Why is that?)
- Covering points with orthogonal polygons
- Covering points with orthogonally convex polygons
- Reconstructing polygons from scanner data
- Reconstructing orthogonal polyhedra from putative vertex sets
Cited In (10)
- Orthogonally convex covering of orthogonal polygons without holes
- Minimum area polygons with two reflex angles enclosingkPoints
- Covering points with orthogonal polygons
- Covering points with orthogonally convex polygons
- On maximum area polygons in a planar point set
- Optimal space coverage with white convex polygons
- Covering points with convex sets of minimum size
- Covering Points with Convex Sets of Minimum Size
- A Scheme for Computing Minimum Covers within Simple Regions
- A scheme for computing minimum covers within simple regions
This page was built for publication: Covering points with minimum/maximum area orthogonally convex polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283887)
