Efficiently Disassemble-and-Pack for Mechanism

01/08/2018
by   Mingyuan Li, et al.
0

In this paper, we present a disassemble-and-pack approach for a mechanism to seek a box which contains total mechanical parts with high space utilization. Its key feature is that mechanism contains not only geometric shapes but also internal motion structures which can be calculated to adjust geometric shapes of the mechanical parts. Our system consists of two steps: disassemble mechanical object into a group set and pack them within a box efficiently. The first step is to create a hierarchy of possible group set of parts which is generated by disconnecting the selected joints and adjust motion structures of parts in groups. The aim of this step is seeking total minimum volume of each group. The second step is to exploit the hierarchy based on breadth-first-search to obtain a group set. Every group in the set is inserted into specified box from maximum volume to minimum based on our packing strategy. Until an approximated result with satisfied efficiency is accepted, our approach finish exploiting the hierarchy.

READ FULL TEXT

page 1

page 2

research
04/12/2021

Shapes In A Box – Disassembling 3D objects for efficient packing and fabrication

Modern 3D printing technologies and the upcoming mass-customization para...
research
08/02/2022

Mates2Motion: Learning How Mechanical CAD Assemblies Work

We describe our work on inferring the degrees of freedom between mated p...
research
02/13/2023

Text2shape Deep Retrieval Model: Generating Initial Cases for Mechanical Part Redesign under the Context of Case-Based Reasoning

Retrieving the similar solutions from the historical case base for new d...
research
09/27/2016

Unsupervised Co-segmentation of 3D Shapes via Functional Maps

We present an unsupervised method for co-segmentation of a set of 3D sha...
research
01/10/2018

Mechanical Computing Systems Using Only Links and Rotary Joints

A new paradigm for mechanical computing is demonstrated that requires on...
research
03/25/2020

An Implicit Representation of Swept Volumes based on Local Shapes and Movements

We introduce a new way to implicitly represent swept volumes in 3D. We f...
research
07/03/2019

Generalized Assignment via Submodular Optimization with Reserved Capacity

We study a variant of the generalized assignment problem ( GAP) with gro...

Please sign up or login with your details

Forgot password? Click here to reset