Kang Wu

Kang Wu

Auto-generated profile, based on publicly available information

Kang Wu

School of Mathematical Sciences, University of Science and Technology of China, Hefei, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
19 December 2022 in Visual Computing for Industry, Biomedicine, and Art
Verified
Journal Article
Open access
PDF file
KWKang Wu
Kang Wu
XFXiao-Ming Fu
Xiao-Ming Fu
RCRenjie Chen
Renjie Chen
LLLigang Liu
Ligang Liu
Visual arts refer to art experienced primarily through vision. 3D visual optical art is one of them. Artists use their rich imagination and experience to combine light and objects to give viewers an unforgettable visual experience. However, the design process involves much trial and error; therefore, it is often very time-consuming. This has prompted many researchers to focus on proposing various algorithms to simplify the complicated design processes and help artists quickly realize the arts in their minds. To help computer graphics researchers interested in creating 3D visual optical art, we first classify and review relevant studies, then extract a general framework for solving 3D visual optical art design problems, and finally propose possible directions for future research.

24 October 2024 in Computer Graphics Forum
Verified
Journal Article
Closed access
YHYing He
Ying He
QFQing Fang
Qing Fang
ZZZheng Zhang
Zheng Zhang
TDTielin Dai
Tielin Dai
KWKang Wu
Kang Wu
XFXiao‐Ming Fu
Xiao‐Ming Fu

6 August 2025 in Computers & Graphics
Verified
Journal Article
Closed access
HLHaochen Liu
Haochen Liu
ZLZhi Li
Zhi Li
KWKang Wu
Kang Wu
YCYoucheng Cai
Youcheng Cai
XZXiaoya Zhai
Xiaoya Zhai
XFXiao-Ming Fu
Xiao-Ming Fu

28 September 2023 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
KWKang Wu
Kang Wu
ZZZheng-Yu Zhao
Zheng-Yu Zhao
ZZZheng Zhang
Zheng Zhang
LLLigang Liu
Ligang Liu
XFXiao-Ming Fu
Xiao-Ming Fu
We propose a novel and automatic method to model shapes using a small set of discrete developable patches. Central to our approach is using implicit neural shape representation that makes our algorithm independent of tessellation and allows us to obtain the Gaussian curvature of each point analytically. With this powerful representation, we first deform the input shape to be an almost developable shape with clear and sparse salient feature curves. Then, we convert the deformed implicit field to a triangle mesh, which is further cut to disk topology along parts of the sparse feature curves. Finally, we achieve the resulting piecewise developable mesh by alternatingly optimizing discrete developability, enforcing manufacturability constraints, and merging patches. The feasibility and practicability of our method are demonstrated over various shapes. Compared to the state-of-the-art methods, our method achieves a better tradeoff between the number of developable patches and the approximation error.

22 August 2025 in Computers & Graphics
Verified
Journal Article
Closed access
ZZZheng Zhang
Zheng Zhang
YLYi-Fei Li
Yi-Fei Li
KWKang Wu
Kang Wu
HZHaisen Zhao
Haisen Zhao
XLXu Liu
Xu Liu
XFXiao-Ming Fu
Xiao-Ming Fu

1 July 2026 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
ZZZheng Zhang
Zheng Zhang
KWKang Wu
Kang Wu
YLYi-Fei Li
Yi-Fei Li
XLXu Liu
Xu Liu
XWXiang Wang
Xiang Wang
XFXiao-Ming Fu
Xiao-Ming Fu
We propose a novel method to generate a small set of ruled surfaces that do not collide with the input shape for linear hot-wire rough machining. Central to our technique is a new observation: ruled surfaces constructed by vertical extrusion from planar smooth curves that approach the input shape's outer contour lines without collisions can effectively remove material during rough machining. Accordingly, we develop an iterative algorithm that alternates in each iteration between computing a viewpoint to determine an outer contour line and optimizing a smooth curve to approximate that contour line under the collision-free constraint. Specifically, a view selection approach based on a genetic algorithm is used to optimize the viewpoint for removing materials as much as possible, and an adaptive fitting algorithm is presented to find the constrained curves. The feasibility and practicability of our method are demonstrated through 10 physical examples. Compared with manual designs, our method obtains lower errors with the same number of cuts.