Conjugate shape simplification via precise algebraic planar sweeps toward gear design. (August 2020)

• Record Type: Journal Article
• Authors: Machchhar, Jinesh; Segerman, Henry; Elber, Gershon
• Is Part Of: Computers & graphics. Volume 90(2020)
• Page Start: 1
• Page End: 10
• Publication Date: 2020-08
• Subjects: Swept volumes -- B-Splines -- Algebraic computation -- Freeform shapes -- Constraint solving; 30: Computer Graphics Methodologies - Simulation and Modeling -- .010: Applications -- 110: Computer Graphics Applications -- .060: Engineering/Software for Product and Production Planning; Computer graphics -- Periodicals; 006.6
• DOI: 10.1016/j.cag.2020.05.017
• Languages: English
• ISSNs: 0097-8493

Abstract

Highlights: This work proposes a novel computational framework for design of planar gears. This is achieved by iterative conjugation which is shown to converge within two steps. A robust computational framework for planar sweeps is proposed for conjugation. Graphical abstract: Abstract: Gears play a pivotal role in machine design. This paper proposes an algorithm to simplify the shapes of planar gears. This is achieved via iterative conjugation, using precise algebraic sweeps. The notion of shape simplification is introduced in a mathematically rigorous manner and it is shown that the conjugation process converges, yielding a pair of meshing gears that follow the desired motion. Simplified gear shapes may lead to improved mechanical characteristics and reduction in manufacturing costs. The generality of algebraic sweeps allows precise design of gears with freeform shapes and non-uniform motion transmission. Moreover, the computational framework proposed in this paper is versatile, with applications beyond gear design. A variety of examples from an implementation of our algorithm, that offers topological guarantees, are presented, which demonstrate the robustness and efficacy of our approach.