Pages that link to "Item:Q2366234"
From MaRDI portal
The following pages link to Computing the intersection-depth to polyhedra (Q2366234):
Displaying 17 items.
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- Input design for guaranteed fault diagnosis using zonotopes (Q458850) (← links)
- Witness (Delaunay) graphs (Q551502) (← links)
- Efficient distance computation in configuration space (Q735495) (← links)
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem (Q1040080) (← links)
- Rotational polygon overlap minimization and compaction (Q1265289) (← links)
- Distance measures on intersecting objects and their applications (Q1334639) (← links)
- Densest translational lattice packing of non-convex polygons (Q1602949) (← links)
- An emergent computation approach to the problem of polygon layout with performance constraints (Q1673263) (← links)
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem (Q1762025) (← links)
- A zonotopic set-invariance analysis of replay attacks affecting the supervisory layer (Q2059497) (← links)
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes (Q2160486) (← links)
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering (Q2356195) (← links)
- Fast neighborhood search for two- and three-dimensional nesting problems (Q2643957) (← links)
- An efficient and robust contact algorithm for a compliant contact force model between bodies of complex geometry (Q2655359) (← links)
- Solving the irregular strip packing problem via guided local search for overlap minimization (Q3401324) (← links)
- Interactive generalized penetration depth computation for rigid and articulated models using object norm (Q5419153) (← links)
