The following pages link to (Q4875176):
Displayed 5 items.
- An optimal algorithm for one-separation of a set of isothetic polygons (Q707337) (← links)
- On regular vertices of the union of planar convex objects (Q1017923) (← links)
- Detecting geometric infeasibility (Q1274558) (← links)
- On the complexity of one-shot translational separability. (Q1853067) (← links)
- Intractability of assembly sequencing: Unit disks in the plane (Q5096948) (← links)