BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Asia/Tokyo
X-LIC-LOCATION:Asia/Tokyo
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:JST
DTSTART:18871231T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20250110T023312Z
LOCATION:Hall B7 (1)\, B Block\, Level 7
DTSTART;TZID=Asia/Tokyo:20241205T094600
DTEND;TZID=Asia/Tokyo:20241205T095800
UID:siggraphasia_SIGGRAPH Asia 2024_sess126_papers_526@linklings.com
SUMMARY:gDist: Efficient Distance Computation between 3D Meshes on GPU
DESCRIPTION:Technical Papers\n\nPeng Fan, Wei Wang, and Ruofeng Tong (Zhej
 iang University); Hailong Li (Poisson Soft); and Min Tang (Zhejiang Univer
 sity, Zhejiang Sci-Tech University)\n\nComputing maximum/minimum distances
  between 3D meshes is crucial for various applications, i.e., robotics, CA
 D, VR/AR, etc. In this work, we introduce a highly parallel algorithm (gDi
 st) optimized for Graphics Processing Units (GPUs), which is capable of co
 mputing the distance between two meshes with over 15 million triangles in 
 less than 0.4 milliseconds. By testing on benchmarks with varying characte
 ristics, the algorithm achieves remarkable speedups over prior CPU-based a
 nd GPU-based algorithms on a commodity GPU (NVIDIA GeForce RTX 4090). Nota
 bly, the algorithm consistently maintains high-speed performance, even in 
 challenging scenarios that pose difficulties for prior algorithms.\n\nRegi
 stration Category: Full Access, Full Access Supporter\n\nLanguage Format: 
 English Language\n\nSession Chair: Paul Kry (McGill University)
URL:https://asia.siggraph.org/2024/program/?id=papers_526&sess=sess126
END:VEVENT
END:VCALENDAR