Convex and non-convex objects for the extraction of the maximal shape
Published: 6 February 2020| Version 1 | DOI: 10.17632/phhzsbpkj9.1
Everton Fernandes Silva
Dataset used for the experiments for the problem of Extracting the Maximal Shape from a Convex Object and the problem of Extracting the Maximal Shape from a Non-convex Object (with and without fixed orientations). All files are either of extension .stl or .obj and objects dragon.obj and pig.obj were taken from Lien (2009): Lien, J. -M. (2009). A simple method for computing Minkowski sum boundary in 3D using collision detection. In Algorithmic Foundation of Robotics VIII, pages 401-415. Springer Tracts in Advanced Robotics.
Combinatorial Optimization, Packing Problem