2013 IEEE Virtual Reality (VR) 2013
DOI: 10.1109/vr.2013.6549361
|View full text |Cite
|
Sign up to set email alerts
|

A convex decomposition methodology for collision detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…However, convex bounding volumes are the main research objects for most collision detection methods [16]. The convex partitioning method is always used in the collision detection of concave volumes, which detects each object collision after dividing the objects into several pieces [17][18]. The disadvantage of the convex partitioning method is that the detail of edges is lost if the number of pieces is low; on the other hand, the computing time of collision detection grows as the number of pieces increases.…”
Section: Introductionmentioning
confidence: 99%
“…However, convex bounding volumes are the main research objects for most collision detection methods [16]. The convex partitioning method is always used in the collision detection of concave volumes, which detects each object collision after dividing the objects into several pieces [17][18]. The disadvantage of the convex partitioning method is that the detail of edges is lost if the number of pieces is low; on the other hand, the computing time of collision detection grows as the number of pieces increases.…”
Section: Introductionmentioning
confidence: 99%