Show simple item record

dc.contributor.authorMa, Yuexinen_US
dc.contributor.authorChen, Zhongguien_US
dc.contributor.authorHu, Wenchaoen_US
dc.contributor.authorWang, Wenpingen_US
dc.contributor.editorJu, Tao and Vaxman, Amiren_US
dc.description.abstractPacking problems arise in a wide variety of practical applications. The basic problem is that of placing as many objects as possible in a non-overlapping configuration within a given container. Problems involving irregular shapes are the most challenging cases. In this paper, we consider the most general forms of irregular shape packing problems in 3D space, where both the containers and the objects can be of any shapes, and free rotations of the objects are allowed. We propose a heuristic method for efficiently packing irregular objects by combining continuous optimization and combinatorial optimization. Starting from an initial placement of an appropriate number of objects, we optimize the positions and orientations of the objects using continuous optimization. In combinatorial optimization, we further reduce the gaps between objects by swapping and replacing the deployed objects and inserting new objects. We demonstrate the efficacy of our method with experiments and comparisons.en_US
dc.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectI.3.5 [Computer Graphics]
dc.subjectComputational Geometry and Object Modeling
dc.subjectGeometric algorithms
dc.subjectand systems
dc.titlePacking Irregular Objects in 3D Space via Hybrid Optimizationen_US
dc.description.seriesinformationComputer Graphics Forum
dc.description.sectionheadersGeometric Optimization

Files in this item


This item appears in the following Collection(s)

  • 37-Issue 5
    Geometry Processing 2018 - Symposium Proceedings

Show simple item record