P2M++ speeds up point-to-mesh distance queries 3-10x in preprocessing and 1.5x at runtime over P2M by adaptive site augmentation, BVH collision reformulation, and dynamic programming search.
Mario Botsch, Leif Kobbelt, Mark Pauly, Pierre Alliez, and Bruno Lévy
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
P2M++: Enhanced Solver for Point-to-Mesh Distance Queries
P2M++ speeds up point-to-mesh distance queries 3-10x in preprocessing and 1.5x at runtime over P2M by adaptive site augmentation, BVH collision reformulation, and dynamic programming search.