57 citations · 130 across the 22 of their papers we have counts for
6 papers · 1 filter
Manifold k-NN: Accelerated k-NN Queries for Manifold Point Clouds
Pengfei Wang, Qinghao Guo, Haisen Zhao +4
k-nearest neighbor (k-NN) search is a fundamental primitive in geometry processing and computer graphics. While spatial partitioning structures such as kd-trees are standard, they…
Toward Precise Curve Offsetting Constrained to Parametric Surfaces
Jin Zhao, Pengfei Wang, Shuangmin Chen +4
Computing offsets of curves on parametric surfaces is a fundamental yet challenging operation in computer aided design and manufacturing. Traditional analytical approaches suffer f…
Swept Volume Computation with Enhanced Geometric Detail Preservation
Pengfei Wang, Yuexin Yang, Shuangmin Chen +3
Swept volume computation, the determination of regions occupied by moving objects, is essential in graphics, robotics, and manufacturing. Existing approaches either explicitly trac…
Power Diagram Enhanced Adaptive Isosurface Extraction from Signed Distance Fields
Pengfei Wang, Ziyang Zhang, Wensong Wang +4
Extracting high-fidelity mesh surfaces from Signed Distance Fields has become a fundamental operation in geometry processing. Despite significant progress over the past decades, ke…
Efficient Nearest Neighbor Search Using Dynamic Programming
Pengfei Wang, Jiantao Song, Shiqing Xin +4
Given a collection of points in R^3, KD-Tree and R-Tree are well-known nearest neighbor search (NNS) algorithms that rely on space partitioning and spatial indexing techniques. How…
SurfaceVoronoi: Efficiently Computing Voronoi Diagrams over Mesh Surfaces with Arbitrary Distance Solvers
Shiqing Xin, Pengfei Wang, Rui Xu +5
In this paper, we propose to compute Voronoi diagrams over mesh surfaces driven by an arbitrary geodesic distance solver, assuming that the input is a triangle mesh as well as a co…