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):
Displaying 12 items.
- Asymptotic number of \(\mathbb{Z}^3 \Delta\) cells covering \(\mathcal{C}^{(1)}\) surface on uniform grid and complexity of recursive-partitioning simulation of septal tissue regions (Q298717) (← links)
- On the union of cylinders in three dimensions (Q629833) (← links)
- A single cell in an arrangement of convex polyhedra in \(\mathbb R^3\) (Q866969) (← links)
- Extremal problems on triangle areas in two and three dimensions (Q1040833) (← links)
- Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom (Q1194309) (← links)
- On the complexity of a single cell in certain arrangements of surfaces related to motion planning (Q1314439) (← links)
- Almost tight upper bounds for lower envelopes in higher dimensions (Q1338960) (← links)
- 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)
