Pages that link to "Item:Q912393"
From MaRDI portal
The following pages link to Covering convex sets with non-overlapping polygons (Q912393):
Displaying 17 items.
- New results on the coarseness of bicolored point sets (Q522958) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- Allowable interval sequences and separating convex sets in the plane (Q664360) (← links)
- Geometric orderings of intersecting translates and their applications (Q676584) (← links)
- Geometric Knapsack problems (Q689105) (← links)
- Separable partitions (Q1283783) (← links)
- Geometric clustering in normed planes (Q1631777) (← links)
- Orthogonally convex covering of orthogonal polygons without holes (Q1825650) (← links)
- The lower bound of the number of non-overlapping triangles. (Q1871441) (← links)
- Separation and approximation of polyhedral objects (Q1900992) (← links)
- On visibility and covering by convex sets (Q1961351) (← links)
- Three-clustering of points in the plane. (Q2482902) (← links)
- Covering Points with Convex Sets of Minimum Size (Q2803821) (← links)
- Covering the Boundary of a Convex Set by Tiles (Q3821208) (← links)
- Counting Blanks in Polygonal Arrangements (Q4585744) (← links)
- Mathematical characterizations and computational complexity of anti-slide puzzles (Q5918568) (← links)
- Mathematical characterizations and computational complexity of anti-slide puzzles (Q5919108) (← links)