Extension of the Voronoi Diagram Algorithm to Orthotropic Space for Material Structural Design

被引:1
|
作者
Bolshakov, Pavel [1 ,2 ]
Kharin, Nikita [1 ]
Agathonov, Alexander [1 ]
Kalinin, Evgeniy [1 ]
Sachenkov, Oskar [1 ]
机构
[1] Kazan Fed Univ, Inst Math & Mech, Kazan 420008, Russia
[2] Kazan Natl Res Tech Univ, Dept Machines Sci & Engn Graph, Kazan 420111, Russia
关键词
structural design; porous constructions; structural material; orthotropic material; Voronoi diagram; POROUS STRUCTURES;
D O I
10.3390/biomimetics9030185
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Nowadays, the interaction of additive technologies and methods for designing or optimizing porous structures has yielded good results. Construction with complex microarchitectures can be created using this approach. Varying the microarchitecture leads to changes in weight and mechanical properties. However, there are problems with geometry reconstruction when dealing with complex microarchitecture. One approach is to use Voronoi cells for geometry reconstruction. In this article, an extension of the Voronoi diagram algorithm to orthotropic space for material structural design is presented. The inputs for the method include porosity, ellipticity, and ellipticity direction fields. As an example, a beam with fixed end faces and center kinematic loading was used. To estimate robust results for different numbers of clusters, 50, 75, and 100 clusters are presented. The porosity for smoothed structures ranged from 21.5% up to 22.8%. The stress-strain state was determined for the resulting structures. The stiffness for the initial and smoothed structures was the same. However, in the case of 75 and 100 clusters, local stress factors appeared in the smoothed structure. The maximum von Mises stress decreased by 20% for all smoothed structures in the area of kinematic loading and increased by 20% for all smoothed structures in the area of end faces.
引用
收藏
页数:15
相关论文
共 50 条
  • [21] A nearly optimal deterministic parallel Voronoi diagram algorithm
    Cole, R
    Goodrich, MT
    ODunlaing, C
    ALGORITHMICA, 1996, 16 (06) : 569 - 617
  • [22] An algorithm for point cluster generalization based on the Voronoi diagram
    Yan, Haowen
    Weibel, Robert
    COMPUTERS & GEOSCIENCES, 2008, 34 (08) : 939 - 954
  • [23] A hierarchical proximity search algorithm based on Voronoi diagram
    Cai, Qiang
    Cheng, Baiyu
    Li, Haisheng
    Mao, Dianhui
    Cheng, Baiyu, 1600, Binary Information Press (11): : 4931 - 4941
  • [24] Algorithm for target traversing based on local Voronoi diagram
    Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai 200240, China
    Ruan Jian Xue Bao, 2007, 5 (1246-1253):
  • [25] A particle tracking velocimetry algorithm based on the Voronoi diagram
    Zhang, Yang
    Wang, Yuan
    Yang, Bin
    He, Wenbo
    MEASUREMENT SCIENCE AND TECHNOLOGY, 2015, 26 (07)
  • [26] Reduction of the search space in the edge-tracing algorithm for the Voronoi diagram of 3D balls
    Cho, Youngsong
    Kim, Donguk
    Lee, Hyun Chan
    Park, Joon Young
    Kim, Deok-Soo
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 1, 2006, 3980 : 111 - 120
  • [27] A framework of Voronoi diagram for planning multiple paths in free space
    Banerjee, Bonny
    Chandrasekaran, B.
    JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 2013, 25 (04) : 457 - 475
  • [28] Design and optimization for bench blast based on Voronoi diagram
    Liu, Jun
    Sun, Pinyu
    Liu, Fangxue
    Zhao, Mingsheng
    INTERNATIONAL JOURNAL OF ROCK MECHANICS AND MINING SCIENCES, 2014, 66 : 30 - 40
  • [29] Extension of the edge tracing algorithm to disconnected Voronoi skeletons
    Manak, Martin
    Kolingerova, Ivana
    INFORMATION PROCESSING LETTERS, 2016, 116 (02) : 85 - 92
  • [30] A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
    Berman, P
    Lingas, A
    THEORETICAL COMPUTER SCIENCE, 1997, 174 (1-2) : 193 - 202