Convex and non-convex objects for the extraction of the maximal shape

Published: 6 Feb 2020 | Version 1 | DOI: 10.17632/phhzsbpkj9.1
Contributor(s):

Description of this data

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.

Experiment data files

Latest version

  • Version 1

    2020-02-06

    Published: 2020-02-06

    DOI: 10.17632/phhzsbpkj9.1

    Cite this dataset

    Fernandes Silva, Everton (2020), “Convex and non-convex objects for the extraction of the maximal shape ”, Mendeley Data, v1 http://dx.doi.org/10.17632/phhzsbpkj9.1

Statistics

Views: 163
Downloads: 33

Categories

Combinatorial Optimization, Packing Problem

Licence

CC BY 4.0 Learn more

The files associated with this dataset are licensed under a Creative Commons Attribution 4.0 International licence.

What does this mean?
You can share, copy and modify this dataset so long as you give appropriate credit, provide a link to the CC BY license, and indicate if changes were made, but you may not do so in a way that suggests the rights holder has endorsed you or your use of the dataset. Note that further permission may be required for any content within the dataset that is identified as belonging to a third party.

Report