Pages that link to "Item:Q1906044"
From MaRDI portal
The following pages link to Almost tight upper bounds for the single cell and zone problems in the three dimensions (Q1906044):
Displayed 5 items.
- Combinatorial complexity of translating a box in polyhedral 3-space (Q1384201) (← links)
- Computing the Betti numbers of arrangements via spectral sequences (Q1886454) (← links)
- A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment (Q1923770) (← links)
- Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes (Q4513205) (← links)
- Robot motion planning (Q4884670) (← links)
