Course overview [PDF]


๐Ÿ“’Lecture slides

Lecture 1. Proximity query overview [slides]

Lecture 2. Basic proximity query algorithms [slides]

Lecture 3. Advanced proximity computation approaches [slides]

๐ŸŽ™๏ธPaper seminar (by students)

Candidate paper list

No. Date Paper title Speaker
1 10/21 Fast distance queries with rectangular swept sphere volumes ์ตœํ•œ๋‚˜
2 10/21 Fast BVH Construction on GPUs ๊ถŒ์„ฑ๋ฏผ
3 10/21 Interactive Hausdorff Distance Computation for General Polygonal Models ์œคํ˜ธ์˜
4 10/28 Radial View Based Culling for Continuous Self-Collision Detection of Skeletal Models ์˜ˆ์›ํƒœ
5 10/28 Scalable Nearest Neighbor Algorithms for High Dimensional Data ์ตœ๋Œ€์ค€
6 10/28 Continuous signed distance computation for polygonal robots in 3D ์กฐ๊ทผ์šฐ
7 11/04 ikd-Tree: An Incremental K-D Tree for Robotic Applications ์œ ์žฌ๋ฏผ
8 11/04 Fast GPU-based Locality Sensitive Hashing for K-Nearest Neighbor Computation ๋‚จ์„ ์‹
9 11/04 K-Nearest Neighbor Search by Random Projection Forests ์ตœํ•œ๋‚˜
10 11/18 Stackless Multi-BVH Traversal for CPU, MIC and GPU Ray Tracing ๊ถŒ์„ฑ๋ฏผ
11 11/18 Real-Time Collision Detection for Deformable Characters with Radial Fields ์œคํ˜ธ์˜
12 11/18 Collision Detection for Industrial Collaborative Robots: A Deep Learning Approach ์˜ˆํƒœ์›
13 11/25 Image Super-Resolution With Self-Similarity Prior Guided Network and Sample-Discriminating Learning ์ตœ๋Œ€์ค€
14 11/25 C2A: Controlled Conservative Advancement for Continuous Collision Detection of Polygonal Models ์กฐ๊ทผ์šฐ
15 12/02 Voxelized GICP for Fast and Accurate 3D Point Cloud Registration ์œ ์žฌ๋ฏผ
16 12/02 BANG: Billion-Scale Approximate Nearest Neighbor Search using a Single GPU ๋‚จ์„ ์‹

Copyright 2025. Spatial Intelligence Lab., KOREATECH. All right reserved.