Xiangzhi Wei

Xiangzhi Wei


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 October 2017 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
XWXiangzhi Wei
Xiangzhi Wei
SQSiqi Qiu
Siqi Qiu
LZLin Zhu
Lin Zhu
RFRuiliang Feng
Ruiliang Feng
YTYaobin Tian
Yaobin Tian
YZYouyi Zheng
Youyi Zheng
Minimizing support structures is crucial in reducing 3D printing material and time. Partition-based methods are efficient means in realizing this objective. Although some algorithms exist for support-free fabrication of solid models, no algorithm ever considers the problem of support-free fabrication for shell models (i.e., hollowed meshes). In this paper, we present a skeleton-based algorithm for partitioning a 3D surface model into the least number of parts for 3D printing without using any support structure. To achieve support-free fabrication while minimizing the effect of the seams and cracks that are inevitably induced by the partition, which affect the aesthetics and strength of the final assembled surface, we put forward an optimization system with the minimization of the number of partitions and the total length of the cuts, under the constraints of support-free printing angle. Our approach is particularly tailored for shell models, and it can be applicable to solid models as well. We first rigorously show that the optimization problem is NP-hard and then propose a stochastic method to find an optimal solution to the objectives. We propose a polynomial-time algorithm for a special case when the skeleton graph satisfies the requirement that the number of partitioned parts and the degree of each node are bounded by a small constant. We evaluate our partition method on a number of 3D models and validate our method by 3D printing experiments.

7 June 2019 in Journal of Computing and Information Science in Engineering
Verified
Journal Article
Closed access
PDF file
LZLin Zhu
Lin Zhu
RFRuiliang Feng
Ruiliang Feng
XLXianda Li
Xianda Li
JXJuntong Xi
Juntong Xi
XWXiangzhi Wei
Xiangzhi Wei

6 November 2019 in Computer-Aided Design and Applications
Verified
Journal Article
Closed access
LZLin Zhu
Lin Zhu
RFRuiliang Feng
Ruiliang Feng
JXJuntong Xi
Juntong Xi
PLPeng Li
Peng Li
XWXiangzhi Wei
Xiangzhi Wei
Computer-Aided Design and Applications is an international journal on the applications of CAD and CAM. It publishes papers in the general domain of CAD plus in emerging fields like bio-CAD, nano-CAD, soft-CAD, garment-CAD, PLM, PDM, CAD data mining, CAD and the internet, CAD education, genetic algorithms and CAD engines. The journal is aimed at all developers and users of CAD technology to ptovide CAD solutions for various stages of design and manufacturing. The journal publishes all about Computer-Aided Design and Computer-Aided technologies.

20 January 2021 in Algorithms
Verified
Journal Article
Open access
PDF file
HZHaohao Z'hou
Haohao Z'hou
XWXiangzhi Wei
Xiangzhi Wei
In this paper, we propose a particle swarm optimization variant based on a novel evaluation of diversity (PSO-ED). By a novel encoding of the sub-space of the search space and the hash table technique, the diversity of the swarm can be evaluated efficiently without any information compression. This paper proposes a notion of exploration degree based on the diversity of the swarm in the exploration, exploitation, and convergence states to characterize the degree of demand for the dispersion of the swarm. Further, a disturbance update mode is proposed to help the particles jump to the promising regions while reducing the cost of function evaluations for poor particles. The effectiveness of PSO-ED is validated on the CEC2015 test suite by comparison with seven popular PSO variants out of 12 benchmark functions; PSO-ED achieves six best results for both 10-D and 30-D.

11 December 2017 in Journal of Mechanical Design
Verified
Journal Article
Closed access
PDF file
XLXianda Li
Xianda Li
JZJie Zhao
Jie Zhao
RHRen He
Ren He
YTYaobin Tian
Yaobin Tian
XWXiangzhi Wei
Xiangzhi Wei

14 October 2019 in Rapid Prototyping Journal
Verified
Journal Article
Closed access
XWXiangzhi Wei
Xiangzhi Wei
XLXianda Li
Xianda Li
SWShanshan Wen
Shanshan Wen
YZYu Zheng
Yu Zheng
YTYaobin Tian
Yaobin Tian
Purpose: For any 3D model with chambers to be fabricated in powder-bed additive manufacturing processes such as SLM and SLS, powders are trapped in the chambers of the finished model. This paper aims to design a shortest network with the least number of outlets for efficiently leaking the trapped powders. Design/methodology/approach: This paper proposes a nonlinear objective with linear constraints for solving the channel design problem and a particle swarm optimization algorithm to solve the nonlinear system. Findings: Structural optimization for the channel network leads to fairly short channels in the interior of the 3D models and very few outlets on the model surface, which achieves the cleaning of the powders while causing almost the least changes to the model. Originality/value: This paper reveals the NP-harness of computing the shortest channel network with the least number of outlets. The proposed approach helps the design of lightweight models using the powder-bed additive manufacturing techniques.