Pages that link to "Item:Q1271271"
From MaRDI portal
The following pages link to Minimum convex partition of a polygon with holes by cuts in given directions (Q1271271):
Displaying 9 items.
- Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles (Q1196367) (← links)
- On convex partitions of polygonal regions (Q1296981) (← links)
- Minimum convex partition of polygonal domains by guillotine cuts (Q1380781) (← links)
- Minimum stabbing rectangular partitions of rectilinear polygons (Q1652208) (← links)
- Approximation algorithms for decomposing octilinear polygons (Q2420578) (← links)
- Minimum Convex Partitions and Maximum Empty Polytopes (Q2904557) (← links)
- (Q4277403) (← links)
- GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY (Q4824661) (← links)
- Minimum convex partition of a polygon with holes by cuts in given directions (Q6487451) (← links)