Pages that link to "Item:Q1825650"
From MaRDI portal
The following pages link to Orthogonally convex covering of orthogonal polygons without holes (Q1825650):
Displaying 15 items.
- On finding a shortest isothetic path and its monotonicity inside a digital object (Q499711) (← links)
- Covering points with orthogonally convex polygons (Q543785) (← links)
- Graph problems arising from parameter identification of discrete dynamical systems (Q634788) (← links)
- NP-harte Probleme für minimale Polygonüberdeckungen. (NP-hard problems for minimal polygon coverings) (Q811138) (← links)
- The orthogonal convex skull problem (Q1102544) (← links)
- On covering orthogonal polygons with star-shaped polygons (Q1193845) (← links)
- Visibility in semi-convex spaces (Q1375948) (← links)
- Staircase visibility and computation of kernels (Q1894710) (← links)
- Note on covering monotone orthogonal polygons with star-shaped polygons (Q2380027) (← links)
- On orthogonally guarding orthogonal polygons with bounded treewidth (Q2659775) (← links)
- Minimum r-Star Cover of Class-3 Orthogonal Polygons (Q2946065) (← links)
- Perfect Graphs and Orthogonally Convex Covers (Q3828050) (← links)
- COVERING CONVEX RECTILINEAR POLYGONS IN LINEAR TIME (Q3986399) (← links)
- POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER (Q4682204) (← links)
- Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem (Q5452162) (← links)