Zeyu Shen

Zeyu Shen

Auto-generated profile, based on publicly available information

Zeyu Shen

Key Laboratory of System Software (Chinese Academy of Sciences), State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
1 July 2021 in Graphical Models
Verified
Journal Article
Closed access
ZSZeyu Shen
Zeyu Shen
MZMingyang Zhao
Mingyang Zhao
XJXiaohong Jia
Xiaohong Jia
YLYuan Liang
Yuan Liang
LFLubin Fan
Lubin Fan
DYDong-Ming Yan
Dong-Ming Yan

6 January 2025 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
ZSZeyu Shen
Zeyu Shen
MZMingyang Zhao
Mingyang Zhao
DYDongming Yan
Dongming Yan
WWWencheng Wang
Wencheng Wang
In boundary representation (B-rep) reconstruction for computer aided design (CAD) applications, it is still challenging with existing methods to distinguish primitives in the smoothly blended regions reasonably. Thus, intensive manual post-processing is always required for correcting the primitives and their neighboring relationships to obtain a valid B-rep solid, seriously preventing the efficiency. In this paper, we address these challenges by presenting two novel techniques. The first is to robustly extract primitives by iteratively estimating the probability distribution of the noise to eliminate outliers. The second is to present intersection-aware constraints, like tangency and collinearity constraints, to correctly obtain intersections between primitives, which have not been explored in existing methods to our knowledge. Therefore, we can effectively extract primitives, especially those blended smoothly, and obtain high-quality relationships between them. As a result, a valid B-rep model can be constructed without a lot of manual post-processing on topology correction, while not with existing methods. As a benefit, with our constructed B-rep models, their corresponding meshes can be intuitively and conveniently edited, which is quite useful in CAD applications. Experimental results show that our proposed B-rep construction method outperforms both classical and recent learning-based methods in terms of reconstruction efficiency and accuracy.

15 October 2024 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
JCJiaxi Chen
Jiaxi Chen
ZSZeyu Shen
Zeyu Shen
MZMingyang Zhao
Mingyang Zhao
XJXiaohong Jia
Xiaohong Jia
DYDongming Yan
Dongming Yan
WWWencheng Wang
Wencheng Wang
Reconstructing CSG trees from CAD models is a critical subject in reverse engineering. While there have been notable advancements in CSG reconstruction, challenges persist in capturing geometric details and achieving efficiency. Additionally, since non-axis-aligned volumetric primitives cannot maintain coplanar characteristics due to discretization errors, existing Boolean operations often lead to zero-volume surfaces and suffer from topological errors during the CSG modeling process. To address these issues, we propose a novel workflow to achieve fast CSG reconstruction and reliable forward modeling. First, we employ feature removal and model subdivision techniques to decompose models into sub-components. This significantly expedites the reconstruction by simplifying the complexity of the models. Then, we introduce a more reasonable method for primitive generation and filtering, and utilize a size-related optimization approach to reconstruct CSG trees. By re-adding features as additional nodes in the CSG trees, our method not only preserves intricate details but also ensures the conciseness, semantic integrity, and editability of the resulting CSG tree. Finally, we develop a coplanar primitive discretization method that represents primitives as large planes and extracts the original triangles after intersection. We extend the classification of triangles and incorporate a coplanar-aware Boolean tree assessment technique, allowing us to achieve manifold and watertight modeling results without zero-volume surfaces, even in extreme degenerate cases. We demonstrate the superiority of our method over state-of-the-art approaches. Moreover, the reconstructed CSG trees generated by our method contain extensive semantic information, enabling diverse model editing tasks.

19 July 2026
Verified
Conference Paper
Open access
DQDafei Qin
Dafei Qin
RXRui Xu
Rui Xu
ZSZeyu Shen
Zeyu Shen
KQKaichun Qiao
Kaichun Qiao
HLHongyang Lin
Hongyang Lin
TKTaku Komura
Taku Komura
Generative CAD modeling has broad design and application potential. Despite significant advances in Boundary Representation (B-Rep) generation, the dominant representation in CAD, existing methods largely depend on uniformly sampled point- or grid-based geometry representations, sacrificing native surface types and parameters and thereby limiting geometric fidelity and downstream usability. We present ParaCAD, an autoregressive framework for point-cloud-conditioned B-Rep generation that directly operates on native parametric surfaces. ParaCAD introduces a surface-centric tokenization that explicitly encodes each face by its exact surface type and continuous parameters, preserving the intrinsic semantics of CAD geometry. Our model first generates parametric surfaces with constrained UV domains, and then constructs a valid B-Rep by globally intersecting these surfaces to recover edges and vertices. ParaCAD places point-cloud-conditioned generation at the core of B-Rep synthesis, making it practical for user-guided reconstruction and seamless integration into existing 3D generation pipelines. Extensive experiments demonstrate that ParaCAD produces accurate B-Reps with faithful point-cloud alignment, outperforming point-based baselines in geometric precision, robustness, watertightness and downstream usability.