13 citations · 13 across the 4 of their papers we have counts for
5 papers
Projective Normal Fields: A Convex Optimization Method for Constructing Smooth UDFs
Jiayi Kong, Chen Zong, Fei Hou +3
Constructing a smooth approximation of an unsigned distance field (UDF) from a raw point cloud is challenging because the input provides neither surface connectivity nor consistent…
P2M++: Enhanced Solver for Point-to-Mesh Distance Queries
Qinghao Guo, Pengfei Wang, Chen Zong +5
Point-to-mesh distance queries are fundamental in computer graphics and geometric modeling. While the state-of-the-art P2M method achieves high-speed queries via Voronoi-based loca…
Voronoi-Assisted Optimization for Diffusing Unsigned Distance Fields from Unoriented Points
Jiayi Kong, Chen Zong, Junkai Deng +6
Unsigned Distance Fields (UDFs) provide a flexible representation for 3D shapes with arbitrary topology, including open and closed surfaces, orientable and non-orientable geometrie…
Quasi-Medial Distance Field (Q-MDF): A Robust Method for Approximating and Discretizing Neural Medial Axes
Jiayi Kong, Chen Zong, Jun Luo +5
The medial axis, a lower-dimensional descriptor that captures the extrinsic structure of a shape, plays an important role in digital geometry processing. Despite its importance, co…
P2M: A Fast Solver for Querying Distance from Point to Mesh Surface
Chen Zong, Jiacheng Xu, Jiantao Song +4
Most of the existing point-to-mesh distance query solvers, such as Proximity Query Package (PQP), Embree and Fast Closest Point Query (FCPW), are based on bounding volume hierarchy…