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

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‐HDI...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer graphics forum Jg. 44; H. 7
Hauptverfasser: Kim, Young Woo, Lee, Jaehong, Kim, Duksu
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Oxford Blackwell Publishing Ltd 01.10.2025
Schlagworte:
CCS Concepts
Computation
Computing methodologies → Shape analysis
Mesh geometry models
Metric space
Parallel algorithms
Ray tracing
ISSN:0167-7055, 1467-8659
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0167-7055
1467-8659
DOI:10.1111/cgf.70229