A progressive method of mounting machine parts on the shaft

Arbuzov, M.O.; Nekrasov, A. D.; Sobolev, Alexandr

doi:10.1088/1757-899x/709/2/022066

Cited by 3 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To simplify the synthesis and calculation of gear-lever mechanisms, the authors proposed a software module that is constantly being updated. In the future, it is planned to automatically generate synthesized models of gear-lever mechanisms in the threedimensional space of the T-Flex CAD environment [13,14,15]. 4.…”

Section: Discussionmentioning

confidence: 99%

To the problem of computer-aided design of gear-and-leverage mechanisms

et al. 2020

View full text Add to dashboard Cite

The possibilities of using gear-lever mechanisms in modern mechanical engineering are described on the example of three mechanisms from different areas of industry. For practical application, a method of structural and kinematic analysis of gear-lever mechanisms is proposed, implemented using the program module developed by the authors, and an algorithm for kinematic calculation of a gear-lever three-wheeled articulated four-link, as the most common and used in mechanical engineering, is given.

show abstract

Section: Discussionmentioning

confidence: 99%

To the problem of computer-aided design of gear-and-leverage mechanisms

et al. 2020

View full text Add to dashboard Cite

show abstract

“…The problem of finding the best way to place objects of complex geometric shapes is characterized by a wide range of its practical applications. Among the most common areas of such practical applications are [1][2][3][4][5][6][7]:…”

Section: Introductionmentioning

confidence: 99%

Algorithms for Working with Orthogonal Polyhedrons in Solving Cutting and Packing Problems

Chekanin

2021

Proceedings of the 31th International Conference on Computer Graphics and Vision. Volume 2

View full text Add to dashboard Cite

In this paper problems of cutting and packing objects of complex geometric shapes are considered. To solve these NP-hard problems, it is proposed to use an approach based on geometric transformation of polygonal objects to composite objects (orthogonal polyhedrons) made up of rectangles or parallelepipeds of a given dimension. To describe the free space inside a voxelized container, a model of potential containers is used as the basic model that provides the ability of packing orthogonal polyhedrons. A number of specialized algorithms are developed to work with orthogonal polyhedrons including: algorithms for placing and removing composite objects, an algorithm for forming a packing with a given distance between objects to be placed. Two algorithms for the placement of orthogonal polyhedrons are developed and their efficiency is investigated. An algorithm for obtaining a container of complex shape presented as an orthogonal polyhedron based on a polygonal model is given. The article contains examples of placement schemes obtained by the developed algorithms for solving problems of packing two-dimensional and three-dimensional non-rectangular composite objects.

show abstract