Pages that link to "Item:Q2708236"
From MaRDI portal
The following pages link to Penetration depth of two convex polytopes in 3D (Q2708236):
Displaying 8 items.
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem (Q1040080) (← links)
- Faster core-set constructions and data-stream algorithms in fixed dimensions (Q2507158) (← links)
- Solving the irregular strip packing problem via guided local search for overlap minimization (Q3401324) (← links)
- Removing Node Overlaps Using Multi-sphere Scheme (Q3611863) (← links)
- Approximate convex intersection detection with applications to width and Minkowski sums (Q5009560) (← links)
- Interactive generalized penetration depth computation for rigid and articulated models using object norm (Q5419153) (← links)
- An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry (Q6551075) (← links)
