Computing Penetration Depth of Collision Detection between Primitives

被引:0
|
作者
Sulaiman, Hamzah Asyrani [1 ]
Othman, Mohd Azlishah [1 ]
Zainudin, Muhammad Noorazlan Shah [1 ]
Bin Darsono, Abd Majid [1 ]
Bade, Abdullah [2 ]
Abdullah, Mohd Harun [2 ]
机构
[1] Univ Tekn Malaysia Melaka, Durian Tunggal, Melaka, Malaysia
[2] Univ Malaysia Sabah, Sch Sci & Technol, Kota Kinabalu, Malaysia
关键词
collision detection; penetration depth; virtual environment;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
DyOP-PD is the third part of narrow phase collision detection that involved finding the penetration depth using Dynamic Pivot Point (DyOP) technique. After the object or the primitive has collided into another primitive, penetration depth algorithm will check for any significant penetration that might occurs upon the intersection. In our implementation, we propose our own algorithm called DyOP-PD where the implementation will be done in 2D for Lin Canny, GJK and DyOP technique and 3D for Lin Canny and DyOP technique. In this chapter, we will explain the concept of our DyOP-PD algorithm that has efficiently contributed to faster penetration depth computation when using DyOP technique.
引用
收藏
页码:497 / 501
页数:5
相关论文
共 50 条
  • [1] Differentiable Collision Detection for a Set of Convex Primitives
    Tracy, Kevin
    Howel, Taylor A.
    Manchester, Zachary
    [J]. 2023 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, ICRA, 2023, : 3663 - 3670
  • [2] IMPLICITLY SEARCHING CONVOLUTIONS AND COMPUTING DEPTH OF COLLISION
    DOBKIN, D
    HERSHBERGER, J
    KIRKPATRICK, D
    SURI, S
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 450 : 165 - 180
  • [3] Differentiable Collision Avoidance Using Collision Primitives
    Zimmermann, Simon
    Busenhart, Matthias
    Huber, Simon
    Poranne, Roi
    Coros, Stelian
    [J]. 2022 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2022, : 8086 - 8093
  • [4] An algorithm on collision detection by computing the minimum distance between two convex polyhedra
    Jin, Hanjun
    Wang, Yanlin
    Wang, Xiaorong
    Fu, Jia
    [J]. WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 304 - 304
  • [5] An algorithm for rapidly computing the minimum distance between two objects collision detection
    Gong, Faming
    Gao, Bo
    Niu, Qiuli
    [J]. CISP 2008: FIRST INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING, VOL 2, PROCEEDINGS, 2008, : 676 - 679
  • [6] Computation of a penetration measure between 3D convex polyhedral objects for collision detection
    Sridharan, K
    Keerthi, SS
    [J]. JOURNAL OF ROBOTIC SYSTEMS, 2001, 18 (11): : 623 - 631
  • [7] Computing the penetration depth of two convex polytopes in 3D
    Agarwal, PK
    Guibas, LJ
    Har-Peled, S
    Rabinovitch, A
    Sharir, M
    [J]. ALGORITHM THEORY - SWAT 2000, 2000, 1851 : 328 - 338
  • [8] Neural Collision Fields for Triangle Primitives
    Zesch, Ryan S.
    Modi, Vismay
    Sueda, Shinjiro
    Levin, David I. W.
    [J]. PROCEEDINGS OF THE SIGGRAPH ASIA 2023 CONFERENCE PAPERS, 2023,
  • [9] Scan Primitives for GPU Computing
    Sengupta, Shubhabrata
    Harris, Mark
    Zhang, Yao
    Owens, John D.
    [J]. GRAPHICS HARDWARE 2007: ACM SIGGRAPH / EUROGRAPHICS SYMPOSIUM PROCEEDINGS, 2007, : 97 - +
  • [10] Prediction of penetration depth in a plunging water jet using soft computing approaches
    Onen, Fevzi
    [J]. NEURAL COMPUTING & APPLICATIONS, 2014, 25 (01): : 217 - 227