Xiao-Ming Fu

Xiao-Ming Fu

Auto-generated profile, based on publicly available information

Xiao-Ming Fu

University of Science and Technology of China

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
27 July 2015 in ACM Transactions on Graphics
Verified
Journal Article
Open access
XFXiao-Ming Fu
Xiao-Ming Fu
YLYang Liu
Yang Liu
BGBaining Guo
Baining Guo
Computing locally injective mappings with low distortion in an efficient way is a fundamental task in computer graphics. By revisiting the well-known MIPS (Most-Isometric ParameterizationS) method, we introduce an advanced MIPS method that inherits the local injectivity of MIPS, achieves as low as possible distortions compared to the state-of-the-art locally injective mapping techniques, and performs one to two orders of magnitude faster in computing a mesh-based mapping. The success of our method relies on two key components. The first one is an enhanced MIPS energy function that penalizes the maximal distortion significantly and distributes the distortion evenly over the domain for both mesh-based and meshless mappings. The second is a use of the inexact block coordinate descent method in mesh-based mapping in a way that efficiently minimizes the distortion with the capability not to be trapped early by the local minimum. We demonstrate the capability and superiority of our method in various applications including mesh parameterization, mesh-based and meshless deformation, and mesh improvement.

11 November 2016 in ACM Transactions on Graphics
Verified
Journal Article
Open access
XFXiao-Ming Fu
Xiao-Ming Fu
YLYang Liu
Yang Liu
We present a novel method, called Simplex Assembly , to compute inversion-free mappings with low or bounded distortion on simplicial meshes. Our method involves two steps: simplex disassembly and simplex assembly. Given a simplicial mesh and its initial piecewise affine mapping, we project the affine transformation associated with each simplex into the inversion-free and distortion-bounded space. The projection disassembles the input mesh into disjoint simplices. The disjoint simplices are then assembled to recover the original connectivity by minimizing the mapping distortion and the difference of the disjoint vertices with respect to the piecewise affine transformations, while the piecewise affine mapping is restricted inside the feasible space. Due to the use of affine transformations as variables, our method explicitly guarantees that no inverted simplex occurs, and that the mapping distortion is below the bound during the optimization. Compared with existing methods, our method is robust to an initialization with many inverted elements and positional constraints. We demonstrate the efficiency and robustness of our method through a variety of geometric processing tasks.

30 July 2018 in ACM Transactions on Graphics
Verified
Journal Article
Open access
PDF file
LLLigang Liu
Ligang Liu
CYChunyang Ye
Chunyang Ye
RNRuiqi Ni
Ruiqi Ni
XFXiao-Ming Fu
Xiao-Ming Fu
We propose a novel approach, calledProgressive Parameterizations, to compute foldover-free parameterizations with low isometric distortion on disk topology meshes. Instead of using the input mesh as a reference to define the objective function, we introduce a progressive reference that contains bounded distortion to the parameterized mesh and is as close as possible to the input mesh. After optimizing the bounded distortion energy between the progressive reference and the parameterized mesh, the parameterized mesh easily approaches the progressive reference, thereby also coming close to the input. By iteratively generating the progressive reference and optimizing the bounded distortion energy to update the parameterized mesh, our algorithm achieves high-quality parameterizations with strong practical reliability and high efficiency. We have demonstrated that our algorithm succeeds on a massive test data set containing over 20712 complex disk topology meshes. Compared to the state-of-the-art methods, our method has achieved higher computational efficiency and practical reliability.

20 November 2017 in ACM Transactions on Graphics
Verified
Journal Article
Open access
ZDZhi-Chao Dong
Zhi-Chao Dong
XFXiao-Ming Fu
Xiao-Ming Fu
CZChi Zhang
Chi Zhang
KWKang Wu
Kang Wu
LLLigang Liu
Ligang Liu
Virtual reality applications prefer real walking to provide highly immersive presence than other locomotive methods. Mapping-based techniques are very effective for supporting real walking in small physical workspaces while exploring large virtual scenes. However, the existing methods for computing real walking maps suffer from poor quality due to distortion. In this paper, we present a novel divide-and-conquer method, called Smooth Assembly Mapping (SAM), to compute real walking maps with low isometric distortion for large-scale virtual scenes. First, the input virtual scene is decomposed into a set of smaller local patches. Then, a group of local patches is mapped together into a real workspace by minimizing a low isometric distortion energy with smoothness constraints between the adjacent patches. All local patches are mapped and assembled one by one to obtain a complete map. Finally, a global optimization is adopted to further reduce the distortion throughout the entire map. Our method easily handles teleportation technique by computing maps of individual regions and assembling them with teleporter conformity constraints. A large number of experiments, including formative user studies and comparisons, have shown that our method succeeds in generating high-quality real walking maps from large-scale virtual scenes to small real workspaces and is demonstrably superior to state-of-the-art methods.

2 November 2015 in ACM Transactions on Graphics
Verified
Journal Article
Open access
PDF file
PWPeng-Shuai Wang
Peng-Shuai Wang
XFXiao-Ming Fu
Xiao-Ming Fu
YLYang Liu
Yang Liu
XTXin Tong
Xin Tong
SLShi-Lin Liu
Shi-Lin Liu
BGBaining Guo
Baining Guo
3D geometric features constitute rich details of polygonal meshes. Their analysis and editing can lead to vivid appearance of shapes and better understanding of the underlying geometry for shape processing and analysis. Traditional mesh smoothing techniques mainly focus on noise filtering and they cannot distinguish different scales of features well, even mixing them up. We present an efficient method to process different scale geometric features based on a novel rolling-guidance normal filter. Given a 3D mesh, our method iteratively applies a joint bilateral filter to face normals at a specified scale, which empirically smooths small-scale geometric features while preserving large-scale features. Our method recovers the mesh from the filtered face normals by a modified Poisson-based gradient deformation that yields better surface quality than existing methods. We demonstrate the effectiveness and superiority of our method on a series of geometry processing tasks, including geometry texture removal and enhancement, coating transfer, mesh segmentation and level-of-detail meshing.

1 May 2018 in Computer Aided Geometric Design
Verified
Journal Article
Closed access
SXShiwei Xiao
Shiwei Xiao
HKHongmei Kang
Hongmei Kang
XFXiao-Ming Fu
Xiao-Ming Fu
FCFalai Chen
Falai Chen