PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
October 13, 2025Computer Graphics Forum4 citations

RT‐HDIST: Ray‐Tracing Core‐based Hausdorff Distance Computation

View Full Paper
YKYoung-Woo KimJLJaehong LeeDKDuksu Kim

Key Points

  • RT-HDIST reduces computational overhead for the Hausdorff distance using ray-tracing cores, enhancing processing speed.
  • The algorithm achieves up to a two-order-of-magnitude speedup compared to existing methods on large datasets.
  • By reformulating the problem to focus on nearest-neighbor searches, RT-HDIST ensures exact computational results.
  • Extensive benchmarks validate RT-HDIST's effectiveness in real-time applications within computational geometry.

Abstract

Abstract The Hausdorff distance is a fundamental metric with widespread applications across various fields. However, its computation remains computationally expensive, especially for large‐scale datasets. This work targets exact point‐to‐point Hausdorff distance on point sets. In this work, we present RT‐HDIST, the first Hausdorff distance algorithm accelerated by ray‐tracing cores (RT‐cores). By reformulating the Hausdorff distance problem as a series of nearest‐neighbor searches and introducing a novel quantized voxel‐index space, RT‐HDIST achieves significant reductions in computational overhead while maintaining exact results. Extensive benchmarks demonstrate up to a two‐order‐of‐magnitude speedup over prior state‐of‐the‐art methods, underscoring RT‐HDIST's potential for real‐time and large‐scale applications.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Kim et al. (2025) studied this question.

synapsesocial.com/papers/68ec51e642911f61ef8b2454https://doi.org/10.1111/cgf.70229
Ask AI
Helpful
Bookmark
Share
View Full Paper