Complex mechanical structure tolerancing by means of hyper-graphs

被引:6
|
作者
Giordano, M. [1 ]
Pairel, E. [1 ]
Hernandez, P. [1 ]
机构
[1] Univ Savoie, LMECA, Ecole Super Ingenieurs Annecy, BP 806, F-74016 Annecy 16, France
关键词
tolerancing; graph; hyper-graphs;
D O I
10.1007/1-4020-5438-6_12
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The topological structure of a mechanism is often represented using graphs. In the field of tolerance, the graph constitutes a support for the analysis or the qualitative synthesis of dimensional and geometric tolerances. Unfortunately, the number of elementary features and relations is important even for usual mechanical systems, and they are represented by very complex graphs. In this paper, we propose to represent the mechanisms by hyper-graphs whose vertices themselves are graphs. One creates a set of different graphs, one in the other, like "nested dolls" from the low level of an elementary graph, to the highest level and the most detailed. This structure of hyper-graph is used as a support with a method of tolerances synthesis. This approach allows to deal with a complex tolerancing problem like a succession of more simple problems of tolerance synthesis. An example will illustrate this approach for the qualitative aspects. The graph allows to represent the topological structure of the mechanism and to consider the functional data such as the type of assembly and the functional requirements. Although already used by various authors, the graphs are today generally considered only as tutorial to guide the choice of the. specifications. Our intention is to give to the graphs a role much more significant and even fundamental for the qualitative and quantitative analysis and synthesis of the tolerances. To our knowledge, the concept of hyper-graph is a very new approach in this field.
引用
收藏
页码:105 / +
页数:3
相关论文
共 50 条
  • [1] COLORING OF HYPER-GRAPHS
    KORSHUNOV, AD
    NINCHAK, Y
    KYBERNETIKA, 1976, 12 (01) : 20 - 30
  • [2] Morse hyper-graphs of topological spaces and decompositionsMorse hyper-graphs of topological spaces and decompositionsT. Yokoyama
    Tomoo Yokoyama
    Journal of Applied and Computational Topology, 2025, 9 (1)
  • [3] Radio cover time in hyper-graphs
    Avin, Chen
    Lando, Yuval
    Lotker, Zvi
    AD HOC NETWORKS, 2014, 12 : 278 - 290
  • [4] Complex Multi-Issue Negotiation Using Utility Hyper-Graphs
    Hadfi, Rafik
    Ito, Takayuki
    JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS, 2015, 19 (04) : 514 - 522
  • [5] Representing hyper-graphs by regular languages
    La Torre, S
    Napoli, M
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1998, 1998, 1450 : 571 - 579
  • [6] Directed hyper-graphs for RDF documents
    Antonio Martinez-Morales, Amadis
    Vidal, Maria-Esther
    REVISTA TECNICA DE LA FACULTAD DE INGENIERIA UNIVERSIDAD DEL ZULIA, 2010, 33 (01): : 59 - 67
  • [7] Modeling Complex Nonlinear Utility Spaces Using Utility Hyper-Graphs
    Hadfi, Rafik
    Ito, Takayuki
    MODELING DECISIONS FOR ARTIFICIAL INTELLIGENCE, MDAI 2014, 2014, 8825 : 14 - 25
  • [8] Learning Situation Hyper-Graphs for Video Question Answering
    Khan, Aisha Urooj
    Kuehne, Hilde
    Wu, Bo
    Chheu, Kim
    Bousselham, Walid
    Gan, Chuang
    Lobo, Niels
    Shah, Mubarak
    2023 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2023, : 14879 - 14889
  • [9] The Application of Directed Hyper-Graphs for Analysis of Models of Information Systems
    Molnar, Balint
    Benczur, Andras
    MATHEMATICS, 2022, 10 (05)
  • [10] Design of Spatially Coupled LDPC Codes based on Symbolic Hyper-Graphs
    Battaglioni, Massimo
    Baldi, Marco
    Cancellieri, Giovanni
    2016 24TH INTERNATIONAL CONFERENCE ON SOFTWARE, TELECOMMUNICATIONS AND COMPUTER NETWORKS (SOFTCOM), 2016, : 296 - 300