Extracting maximal objects from three-dimensional solid materials
From MaRDI portal
Publication:2668729
DOI10.1016/j.cor.2021.105290OpenAlexW3138763821MaRDI QIDQ2668729
Wim Vancroonenburg, Everton Fernandes Silva, Tony Wauters, Aline A. S. Leão, Hatice Calik
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/672115
Uses Software
Cites Work
- Unnamed Item
- A collision detection approach for maximizing the material utilization
- Application of general semi-infinite programming to lapidary cutting problems
- Heuristics for container loading of furniture
- Computing a global optimal solution to a design centering problem
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- Mathematical model and efficient algorithms for object packing problem
- Irregular packing problems: a review of mathematical models
- Constraints in container loading -- a state-of-the-art review
- The geometry of nesting problems: a tutorial
- An improved typology of cutting and packing problems
- Fast neighborhood search for two- and three-dimensional nesting problems
- A comparative review of 3D container loading algorithms
- A Simple Method for Computing Minkowski Sum Boundary in 3D Using Collision Detection
- The simplicial approximation approach to design centering
- Packing of convex polytopes into a parallelepiped
- TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator
This page was built for publication: Extracting maximal objects from three-dimensional solid materials
