Comparing two continuous collision detection algorithms on CPU and GPUs

Yao Liu, Xinyu Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Fast filtering algorithms can highly improve the narrow-stage performance of continuous collision detection (CCD). The algorithm by Tang et al. [1] is a fast solution to this problem, which casts it into a geometric constrain. We show that, after slight modification, this earlier work is interestingly equivalent to the recent result by Zhang and Liu [2] that is directly derived from algebraic theorems. We compare the computational complexity and performance for the two algorithms using cloth simulation on CPU and GPUs.

Original languageEnglish
Title of host publicationProceedings - 2016 International Conference on Virtual Reality and Visualization, ICVRV 2016
EditorsDandan Ding, Dangxiao Wang, Jian Chen, Xun Luo
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages212-218
Number of pages7
ISBN (Electronic)9781509051885
DOIs
StatePublished - 1 Jun 2017
Event6th International Conference on Virtual Reality and Visualization, ICVRV 2016 - Hangzhou, Zhejiang, China
Duration: 24 Sep 201626 Sep 2016

Publication series

NameProceedings - 2016 International Conference on Virtual Reality and Visualization, ICVRV 2016

Conference

Conference6th International Conference on Virtual Reality and Visualization, ICVRV 2016
Country/TerritoryChina
CityHangzhou, Zhejiang
Period24/09/1626/09/16

Keywords

  • Continuous Collision Detection
  • Deformable Objects
  • Multi-Core Processors
  • Non-Penetration Filter

Fingerprint

Dive into the research topics of 'Comparing two continuous collision detection algorithms on CPU and GPUs'. Together they form a unique fingerprint.

Cite this