-
公开(公告)号:US20220129595A1
公开(公告)日:2022-04-28
申请号:US17291566
申请日:2020-06-28
Applicant: DALIAN UNIVERSITY OF TECHNOLOGY
Inventor: Shengfa WANG , Yu JIANG , Baojun LI , Yi WANG , Fengqi LI , Zhongxuan LUO
IPC: G06F30/10
Abstract: A design and optimization method of a porous structure for 3D heat dissipation based on triply periodic minimal surface (TPMS) belongs to the field of computer-aided design. Firstly, a porous structure is established through implicit function presentation of TPMS. Secondly, a heat dissipation problem is converted into a minimization problem of thermal compliance under given constraints according to a steady-state heat conduction equation. Then, parametric functions are directly computed through a global-local interpolation method. Finally, period optimization and wall-thickness optimization are conducted for a modeling problem to obtain an optimized porous shell structure with smooth period and wall-thickness change. The porous structure of the present invention greatly improves the heat dissipation performance, and efficiency and effectiveness of heat conduction. The porous structure designed by the present invention has the characteristics of smoothness, full connectivity, controllability and quasi-self-supporting. These characteristics ensure the applicability and the manufacturability of this structure.
-
公开(公告)号:US20220335639A1
公开(公告)日:2022-10-20
申请号:US17437234
申请日:2021-03-05
Applicant: DALIAN UNIVERSITY OF TECHNOLOGY
Inventor: Qi JIA , Xin FAN , Zhongxuan LUO , Yu LIU , Qian WANG , Risheng LIU , Yi WANG , Xiujuan XU
Abstract: The present invention relates to the technical field of digital image processing, and provides an ellipse detection acceleration method based on generalized Pascal mapping. The method comprises: step 100, extracting accurate edge points from a real image by means an edge detection method of an ellipse detection method, connecting edge points into arcs, and taking a de-noised arc set as input of an ellipse detection acceleration method; step 200, screening out a valid candidate arc combinations probably belonging to the same ellipse from the arc set input in step 100; step 300, calculating five parameters of a candidate ellipse; repeating step 200 to step 300 until all valid candidate arc combinations in the arc set and corresponding candidate ellipses are found; and step 400, clustering and verifying candidate ellipse sets, obtaining a final detected ellipse set.
-