Abstract

This paper introduces a new framework for reassembling CAD models of mechanical parts. The generated CAD assemblies are well-constrained, with collision-free parts, and they are ready-to-use for downstream applications. First, input dead CAD models candidate for the reassembly are sorted following a part-by-part interface-based identification algorithm that is capable of characterizing each part according to the assembly slots and interfaces it offers. The slots are then hashed, and the resulting keys are used for fast search of parts in the database. Thus, the parts that can be assembled are quickly identified, and their assembly can be considered according to various scenarios. To support the reassembly steps and satisfy the constraints associated with the specified interfaces, a collision-free kinematic constraint solver is also proposed. During the reassembly steps, the geometry of the slots can also be automatically modified to adjust their dimensions, in order to ensure a perfect fit and to avoid interference at the level of the interfaces. The resulting database can also be further expanded while modifying the relative positions/orientations of the assembled parts. The approach is illustrated on several test cases covering different exploitation scenarios, ranging from simple model reuse to database expansion for machine learning-based applications. Such an automatic reassembly process is particularly innovative, and it clearly paves the way for smart assembly procedures.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.