2009 Fifth International Conference on Natural Computation 2009
DOI: 10.1109/icnc.2009.196
|View full text |Cite
|
Sign up to set email alerts
|

Research on Collision Detection Algorithm Based on AABB

Abstract: An improved collision detection algorithm based on AABB is presented. During the global search, each axis is cut into a series of segments containing the same number of AABBs' projection intervals, and Shell sort is adopted to sort projection lists, not insertion sort.This will avoid needless intersecting test of AABB. During the local detection, the amount of byte of AABB bounding-volume for internal node is reduced according to the constructing process of AABB tree, and leaf nodes are wiped from tree structu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 7 publications
(8 reference statements)
0
8
0
Order By: Relevance
“…Analytical methods, geometric methods, accurate techniques, hierarchical representations, and optimization methods are frequently used (Lin & Gottschalk, 1998). Collision detection is an important topic in areas like robotics, physics modeling, animation, geometric modeling, and video games among others (Bing et al, 2009;Xiao-Rong et al, 2009;Zhigang et al, 2010). Searching for and finding collisions between objects are critical problems based on solving an intersection point or area between objects.…”
Section: Collision Detectionmentioning
confidence: 99%
See 1 more Smart Citation
“…Analytical methods, geometric methods, accurate techniques, hierarchical representations, and optimization methods are frequently used (Lin & Gottschalk, 1998). Collision detection is an important topic in areas like robotics, physics modeling, animation, geometric modeling, and video games among others (Bing et al, 2009;Xiao-Rong et al, 2009;Zhigang et al, 2010). Searching for and finding collisions between objects are critical problems based on solving an intersection point or area between objects.…”
Section: Collision Detectionmentioning
confidence: 99%
“…Other accurate techniques involve mesh, for instance, level of details and triangulation to compare polyhedral by using a face-face test. Several approximations to the solution can be found in the literature; nevertheless, most of them can be classified into three categories: i) geometrics, ii) bounding volume hierarchies, and iii) spatial subdivision (Xiao-Rong et al, 2009). Geometric approaches are based on analyzing the shape of each model, tracking and capturing the closest features between two or more models; for more details, see (Mirtich, 1998).…”
Section: Collision Detectionmentioning
confidence: 99%
“…The fundamental principle of Collision detection technology is that if two completely sealed polyhedrons come into collision, at least one surface of one polyhedron intersects with at least one surface of another one. A suitable response that modifying the physical properties of virtual objects should be made when a collision is detected [5] . c)Behavioral Modeling.Behavioral Modeling is to endow the model inherent characteristics or properties as soon as they are created [6] .…”
Section: Bmentioning
confidence: 99%
“…To tightly fit the different volumes of the robot, researchers have developed algorithms to build each convex polyhedral model. Examples include the tight-fitting oriented bounding box trees (OBB) algorithm [5], and the axis-aligned bounding boxes (AABB) algorithm [6]. Many algorithms have been proposed to calculate the distance in convex polyhedral models such as the fast and robust polyhedral collision detection (V-Clip) algorithm [7].…”
Section: Introductionmentioning
confidence: 99%