Reproduce “P2M: A Fast Solver for Querying Distance from Point to Mesh Surface” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Chen Zong, Jiacheng Xu, Jiantao Song, Shuangmin Chen, Shiqing Xin, Wenping Wang, Changhe Tu
The P2M method provides a fast solver for querying the minimum distance from a point to a mesh surface, leveraging a vertex-based KD-tree combined with a precomputed "interception table". It achieves query speeds 2 to 10 times faster than leading BVH-based solvers on complex models, despite requiring higher preprocessing time and memory.
Key insights
- Combining a vertex-based KDT with an explicit, precomputed 'interception table' for non-vertex primitives can yield substantial speedups for point-to-mesh distance queries.
- The 'flooding inspection' scheme for interception table construction drastically reduces preprocessing time from impractical (days) to feasible (minutes) for large models.
- R-trees effectively manage potentially long interception lists, reducing the number of actual primitive distance calculations required during the query stage to only a few.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.