Controlling the contact levels of details for fast and precise haptic collision detection

被引:9
作者
Choi, A. Ram [1 ]
Kim, Sung Min [1 ]
Sung, Mee Young [1 ]
机构
[1] Incheon Natl Univ, Dept Comp Sci & Engn, Incheon, South Korea
关键词
Collision detection; Haptic rendering; Bounding sphere; Clustering; Contact levels of details (CLOD); REDUCED DEFORMABLE MODELS; MEDIAL-AXIS; HIERARCHIES; OBJECTS; TREE;
D O I
10.1631/FITEE.1500498
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
For accurate and stable haptic rendering, collision detection for interactive haptic applications has to be done by filling in or covering target objects as tightly as possible with bounding volumes (spheres, axis-aligned bounding boxes, oriented bounding boxes, or polytopes). In this paper, we propose a method for creating bounding spheres with respect to the contact levels of details (CLOD), which can fit objects while maintaining the balance between high speed and precision of collision detection. Our method is composed mainly of two parts: bounding sphere formation and two-level collision detection. To specify further, bounding sphere formation can be divided into two steps: creating spheres and clustering spheres. Two-level collision detection has two stages as well: fast detection of spheres and precise detection in spheres. First, bounding spheres are created for initial fast probing to detect collisions of spheres. Once a collision is probed, a more precise detection is executed by examining the distance between a haptic pointer and each mesh inside the colliding boundaries. To achieve this refined level of detection, a special data structure of a bounding volume needs to be defined to include all mesh information in the sphere. After performing a number of experiments to examine the usefulness and performance of our method, we have concluded that our algorithm is fast and precise enough for haptic simulations. The high speed detection is achieved through the clustering of spheres, while detection precision is realized by voxel-based direct collision detection. Our method retains its originality through the CLOD by distance-based clustering.
引用
收藏
页码:1117 / 1130
页数:14
相关论文
共 35 条
  • [11] Approximating the medial axis from the Voronoi diagram with a convergence guarantee
    Dey, TK
    Zhao, W
    [J]. ALGORITHMICA, 2004, 38 (01) : 179 - 200
  • [12] SOLVING THE COLLISION DETECTION PROBLEM
    GARCIAALONSO, A
    SERRANO, N
    FLAQUER, J
    [J]. IEEE COMPUTER GRAPHICS AND APPLICATIONS, 1994, 14 (03) : 36 - 43
  • [13] AUTOMATIC CREATION OF OBJECT HIERARCHIES FOR RAY TRACING
    GOLDSMITH, J
    SALMON, J
    [J]. IEEE COMPUTER GRAPHICS AND APPLICATIONS, 1987, 7 (05) : 14 - 20
  • [14] Gottschalk S., 1996, Computer Graphics Proceedings. SIGGRAPH '96, P171, DOI 10.1145/237170.237244
  • [15] Gregory A., 2005, P ACM SIGGRAPH 2005
  • [16] Approximating polyhedra with spheres for time-critical collision detection
    Hubbard, PM
    [J]. ACM TRANSACTIONS ON GRAPHICS, 1996, 15 (03): : 179 - 210
  • [17] COLLISION DETECTION FOR INTERACTIVE GRAPHICS APPLICATIONS
    HUBBARD, PM
    [J]. IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 1995, 1 (03) : 218 - 230
  • [18] BD-Tree: Output-sensitive collision detection for reduced deformable models
    James, DL
    Pai, DK
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2004, 23 (03): : 393 - 398
  • [19] Efficient collision detection using bounding volume hierarchies of k-DOPs
    Klosowski, JT
    Held, M
    Mitchell, JSB
    Sowizral, H
    Zikan, K
    [J]. IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 1998, 4 (01) : 21 - 36
  • [20] Larsson T., 2001, PROC EUROGRAPHICS, P325, DOI DOI 10.2312/EGS.20011005