Shiqing Xin

Dr. Shiqing Xin


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
26 July 2023 in ACM Transactions on Graphics
Verified
Journal Article
Open access
RXRui Xu
Rui Xu
ZDZhiyang Dou
Zhiyang Dou
NWNingna Wang
Ningna Wang
Shiqing XinShiqing Xin
Shiqing Xin
SCShuangmin Chen
Shuangmin Chen
CTChanghe Tu
Changhe Tu
Estimating normals with globally consistent orientations for a raw point cloud has many downstream geometry processing applications. Despite tremendous efforts in the past decades, it remains challenging to deal with an unoriented point cloud with various imperfections, particularly in the presence of data sparsity coupled with nearby gaps or thin-walled structures. In this paper, we propose a smooth objective function to characterize the requirements of an acceptable winding-number field, which allows one to find the globally consistent normal orientations starting from a set of completely random normals. By taking the vertices of the Voronoi diagram of the point cloud as examination points, we consider the following three requirements: (1) the winding number is either 0 or 1, (2) the occurrences of 1 and the occurrences of 0 are balanced around the point cloud, and (3) the normals align with the outside Voronoi poles as much as possible. Extensive experimental results show that our method outperforms the existing approaches, especially in handling sparse and noisy point clouds, as well as shapes with complex geometry/topology.

20 March 2023 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
QDQiujie Dong
Qiujie Dong
ZWZixiong Wang
Zixiong Wang
MLManyi Li
Manyi Li
JGJunjie Gao
Junjie Gao
SCShuangmin Chen
Shuangmin Chen
WWWenping Wang
Wenping Wang
Geometric deep learning has sparked a rising interest in computer graphics to perform shape understanding tasks, such as shape classification and semantic segmentation. When the input is a polygonal surface, one has to suffer from the irregular mesh structure. Motivated by the geometric spectral theory, we introduce Laplacian2Mesh , a novel and flexible convolutional neural network (CNN) framework for coping with irregular triangle meshes (vertices may have any valence). By mapping the input mesh surface to the multi-dimensional Laplacian-Beltrami space, Laplacian2Mesh enables one to perform shape analysis tasks directly using the mature CNNs, without the need to deal with the irregular connectivity of the mesh structure. We further define a mesh pooling operation such that the receptive field of the network can be expanded while retaining the original vertex set as well as the connections between them. Besides, we introduce a channel-wise self-attention block to learn the individual importance of feature ingredients. Laplacian2Mesh not only decouples the geometry from the irregular connectivity of the mesh structure but also better captures the global features that are central to shape classification and segmentation. Extensive tests on various datasets demonstrate the effectiveness and efficiency of Laplacian2Mesh, particularly in terms of the capability of being vulnerable to noise to fulfill various learning tasks.

29 October 2022 in ACM Transactions on Graphics
Verified
Journal Article
Open access
PWPengfei Wang
Pengfei Wang
ZWZixiong Wang
Zixiong Wang
Shiqing XinShiqing Xin
Shiqing Xin
XGXifeng Gao
Xifeng Gao
WWWenping Wang
Wenping Wang
CTChanghe Tu
Changhe Tu
The task of explicit surface reconstruction is to generate a surface mesh by interpolating a given point cloud. Explicit surface reconstruction is necessary when the point cloud is required to appear exactly on the surface. However, for a non-perfect input, such as lack of normals, low density, irregular distribution, thin and tiny parts, and high genus, a robust explicit reconstruction method that can generate a high-quality manifold triangulation is missing. We propose a robust explicit surface reconstruction method that starts from an initial simple surface mesh, alternately performs a Filmsticking step and a Sculpting step of the initial mesh, and converges when the surface mesh interpolates all input points (except outliers) and remains stable. The Filmsticking is to minimize the geometric distance between the surface mesh and the point cloud through iteratively performing a restricted Voronoi diagram technique on the surface mesh, whereas the Sculpting is to bootstrap the Filmsticking iteration from local minima by applying appropriate geometric and topological changes of the surface mesh. Our algorithm is fully automatic and produces high-quality surface meshes for non-perfect inputs that are typically considered to be challenging for prior state of the art. We conducted extensive experiments on simulated scans and real scans to validate the effectiveness of our approach.

20 October 2020 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
CLCheng Lin
Cheng Lin
LLLingjie Liu
Lingjie Liu
CLChangjian Li
Changjian Li
LKLeif Kobbelt
Leif Kobbelt
BWBin Wang
Bin Wang
WWWenping Wang
Wenping Wang
Segmenting arbitrary 3D objects into constituent parts that are structurally meaningful is a fundamental problem encountered in a wide range of computer graphics applications. Existing methods for 3D shape segmentation suffer from complex geometry processing and heavy computation caused by using low-level features and fragmented segmentation results due to the lack of global consideration. We present an efficient method, called SEG-MAT, based on the medial axis transform (MAT) of the input shape. Specifically, with the rich geometrical and structural information encoded in the MAT, we are able to develop a simple and principled approach to effectively identify the various types of junctions between different parts of a 3D shape. Extensive evaluations and comparisons show that our method outperforms the state-of-the-art methods in terms of segmentation quality and is also one order of magnitude faster.

24 May 2022 in Computer Graphics Forum
Verified
Journal Article
Closed access
ZDZhiyang Dou
Zhiyang Dou
CLCheng Lin
Cheng Lin
RXRui Xu
Rui Xu
LYLei Yang
Lei Yang
Shiqing XinShiqing Xin
Shiqing Xin
WWWenping Wang
Wenping Wang

30 July 2018 in ACM Transactions on Graphics
Verified
Journal Article
Open access
PDF file
HZHaisen Zhao
Haisen Zhao
HZHao Zhang
Hao Zhang
Shiqing XinShiqing Xin
Shiqing Xin
YDYuanmin Deng
Yuanmin Deng
CTChanghe Tu
Changhe Tu
BCBaoquan Chen
Baoquan Chen
We present an automatic algorithm for subtractive manufacturing of freeform 3D objects using high-speed machining (HSM) via CNC. A CNC machine operates a cylindrical cutter to carve off material from a 3D shape stock, following a tool path, to "expose" the target object. Our method decomposes the input object's surface into a small number of patches each of which is fully accessible and machinable by the CNC machine, in continuous fashion, under a fixed cutter-object setup configuration. This is achieved by covering the input surface with a minimum number of accessible regions and then extracting a set of machinable patches from each accessible region. For each patch obtained, we compute a continuous, space-filling, and iso-scallop tool path which conforms to the patch boundary, enabling efficient carving with high-quality surface finishing. The tool path is generated in the form of connected Fermat spirals , which have been generalized from a 2D fill pattern for layered manufacturing to work for curved surfaces. Furthermore, we develop a novel method to control the spacing of Fermat spirals based on directional surface curvature and adapt the heat method to obtain iso-scallop carving. We demonstrate automatic generation of accessible and machinable surface decompositions and iso-scallop Fermat spiral carving paths for freeform 3D objects. Comparisons are made to tool paths generated by commercial software in terms of real machining time and surface quality.