Demo Data from EDBT 2026 / reviewers in the wild / expert
Mingxiu Tuo
dblp:353/3646
· DBLP profile ↗
4ranked-venue papers
2as first author
4since 2021 · last 2026
0009-0001-7414-1426ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 2 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
1 paper |
Geometric modeling and processing · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing
implicit neural representation |
1.0 | 1 | 2026 | VFIR: Vector Fields Implicit Representation for Surface Reconstruction From Point Clouds · IEEE Trans. Vis. Comput. Graph. 2026 |
Geometric modeling and processing › surface reconstruction
point cloud reconstruction |
1.0 | 1 | 2026 | VFIR: Vector Fields Implicit Representation for Surface Reconstruction From Point Clouds · IEEE Trans. Vis. Comput. Graph. 2026 |
Geometric modeling and processing
surface reconstruction |
1.0 | 1 | 2026 | VFIR: Vector Fields Implicit Representation for Surface Reconstruction From Point Clouds · IEEE Trans. Vis. Comput. Graph. 2026 |
Geometric modeling and processing
isosurface extraction |
0.3 | 1 | 2026 | VFIR: Vector Fields Implicit Representation for Surface Reconstruction From Point Clouds · IEEE Trans. Vis. Comput. Graph. 2026 |
Geometric modeling and processing › isosurface extraction
marching cubes |
0.3 | 1 | 2026 | VFIR: Vector Fields Implicit Representation for Surface Reconstruction From Point Clouds · IEEE Trans. Vis. Comput. Graph. 2026 |
Methods — techniques the papers use, named apart from their topics
progressive learning · 1.0neural implicit functions · 1.0marching cubes · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | ACL-UDF: Asymptotically Consistent Learning of Unsigned Distance Fields for Surface ReconstructionabstractABSTRACT Surface reconstruction from point clouds with open boundaries and incomplete geometry remains challenging for existing implicit learning methods, as signed distance field and occupancy‐based approaches inherently rely on closed‐surface assumptions and often produce false closures or boundary distortions, while existing unsigned distance field (UDF) methods suffer from unstable optimization, discontinuities near boundaries, and difficulties in reliable surface extraction. To address these issues, this paper proposes an asymptotically consistent surface reconstruction framework based on UDFs for non‐watertight point clouds. The method adopts a fully unsupervised learning strategy, in which a continuous UDF is optimized through a gradient‐guided point projection mechanism combined with geometric and gradient consistency constraints, enabling stable distance estimation without requiring ground‐truth distances or normals. A progressive learning strategy based on high‐confidence projected points is further introduced to alleviate early‐stage instability and improve robustness under sparse sampling and complex topology. In addition, an intersection‐detection‐based isosurface extraction scheme is designed to infer pseudo‐sign information from local gradient configurations, allowing reliable mesh generation using the Marching Cubes algorithm. Extensive experiments demonstrate that the proposed method achieves superior reconstruction accuracy and robustness compared with state‐of‐the‐art methods, particularly in preserving open boundaries, thin‐walled structures, and fractured regions without erroneous infilling. Mingxiu Tuo, Shunli Zhang 0002 |
Concurr. Comput. Pract. Exp. | 2 |
| 2026 | VFIR: Vector Fields Implicit Representation for Surface Reconstruction From Point CloudsabstractSurface reconstruction from point clouds has attracted considerable attention in the computer vision community. Most deep learning-based methods focus on modeling signed distance functions (SDFs) and unsigned distance functions (UDFs). However, SDFs are limited to watertight models, and UDFs are non-differentiable at the surface boundary, hindering the learning of smooth representations. In this paper, we introduce a novel method, VFIR, which leverages neural implicit functions to learn vector fields (VFs) for 3D shape modeling. We enhance the network's fitting capability by displacing points along the predicted vector directions, aiming to reduce the deviation between the generated point cloud and the original input. To accelerate convergence, we introduce a progressive learning strategy that incrementally incorporates denser point clouds and corresponding normals during training. For isosurface extraction, we define truncated vector fields (TVFs) that focus computation around surfaces and present an optimized three-state marching cubes (OT-MC) algorithm tailored to the vector field representation. Extensive experiments demonstrate that VFIR achieves state-of-the-art performance with high accuracy and robustness across diverse 3D models, exhibiting strong generalization capabilities and thus representing a promising solution for surface reconstruction across various applications. Mingxiu Tuo, Yikuan Gu, Shunli Zhang 0002 |
IEEE Trans. Vis. Comput. Graph. | 2 |
| 2025 | FPM-SSD: Fast Parallel Multi-Scale Smooth Signed Distance Surface ReconstructionabstractABSTRACT Smooth signed distance surface reconstruction remains a popular technique for generating watertight surfaces from discrete point clouds. However, it frequently encounters issues with geometric detail loss when reconstructing complicated models. In this paper, we introduce a novel reconstruction technique for multi‐scale smooth signed distance surfaces based on Gaussian curvature. Initially, the point cloud data is fitted using the moving least squares to calculate the Gaussian curvature. After that, a curvature‐adaptive octree is constructed based on the Gaussian curvature, which can dynamically adjust the local resolution. Geometric information can be captured more effectively, improving the accuracy of surface reconstruction. Finally, implicit functions are adopted to perform global fitting, and the zero‐level set is obtained through the octree isosurface extraction algorithm. In solving the iterative linear system, multi‐thread techniques are implemented for parallel computation to enhance the execution performance of the algorithm. Experimental results demonstrate that the curvature‐adaptive octree based on Gaussian curvature, can effectively capture complex geometric details, and the algorithm accomplishes high‐precision surface reconstruction at different scales. Furthermore, multi‐thread technology enhances local and global computing performance, ensuring the algorithm's effectiveness in processing large‐scale data. Mingxiu Tuo, Chenglei Jia, Shunli Zhang 0002 |
Concurr. Comput. Pract. Exp. | 1 |
| 2025 | A Curvature-Guided Fast and Robust Normal Estimation for Point CloudsabstractABSTRACT Accurate normal estimation is a fundamental task in 3D geometry processing, with wide‐ranging applications in computer vision, robotics, and computer graphics. However, existing globally consistent normal estimation (GCNO) methods are often limited by reduced accuracy and high computational cost when applied to complex models. To address these challenges, we propose a fast and robust point cloud normal estimation method guided by curvature information. The proposed method integrates curvature as a geometric prior into a global winding‐number‐based optimization formulation, effectively enhancing normal orientation consistency while preserving sharp geometric features. Furthermore, to improve computational efficiency, we introduce a PCA‐based visibility‐aware initialization strategy. This strategy adaptively adjusts the initial normal directions by leveraging the local geometric distribution of points, thereby enhancing the consistency of initial normal orientations. Experimental results demonstrate that, compared to the state‐of‐the‐art GCNO method, the proposed approach significantly improves both the accuracy and efficiency of normal estimation. This work provides an effective and precise solution for achieving globally consistent normal estimation in point clouds. Mingxiu Tuo, Puyu Qian, Shunli Zhang 0002 |
Concurr. Comput. Pract. Exp. | 1 |