Orthogonally convex covering of orthogonal polygons without holes

DOI10.1016/0022-0000(89)90043-3zbMath0684.68051OpenAlexW2035284092MaRDI QIDQ1825650

Robert A. Reckhow, Joseph C. Culberson

Publication date: 1989

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(89)90043-3

zbMATH Keywords

computational geometryminimal coverorthogonal polygonsorthogonal convexitycover countingdent diagram

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (9)

Staircase visibility and computation of kernels ⋮ Note on covering monotone orthogonal polygons with star-shaped polygons ⋮ Visibility in semi-convex spaces ⋮ On orthogonally guarding orthogonal polygons with bounded treewidth ⋮ Minimum r-Star Cover of Class-3 Orthogonal Polygons ⋮ Graph problems arising from parameter identification of discrete dynamical systems ⋮ On finding a shortest isothetic path and its monotonicity inside a digital object ⋮ POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER ⋮ Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem

Cites Work

• The orthogonal convex skull problem
• The ellipsoid method and its consequences in combinatorial optimization
• Some NP-hard polygon decomposition problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Orthogonally convex covering of orthogonal polygons without holes