The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Efficient Collision Detection of Complex Deformable Models using AABB Trees
Abstract
We present a scheme for exact collision detection between complex models undergoing rigid motion and deformation. The scheme relies on a hierarchical model representation using axis-aligned bounding boxes (AABBs). Recent work has shown that AABB trees are slower than oriented bounding box (OBB) trees for performing overlap tests. In this paper, we describe a way to speed up overlap tests between AABBs, such that for collision detection of rigid models, the difference in performance between the two representations is greatly reduced. Furthermore, we show how to update an AABB tree quickly as a model is deformed. We thus find AABB trees to be the method of choice for collision detection of complex models undergoing deformation. In fact, because they are not much slower to test, are faster to build, and use less storage than OBB trees, AABB trees might be a reasonable choice for rigid models as well.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
OBBTree: a hierarchical structure for rapid interference detection
Gottschalk, S., Lin, M. C., & Manocha, D. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237244 · Cited by 2,081
Efficient collision detection using bounding volume hierarchies of k-DOPs
Klosowski, J. T., Held, M., Mitchell, J. S. B., Sowizral, H., & Zikan, K. (1998) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.675649 · Cited by 873
Approximating polyhedra with spheres for time-critical collision detection
Hubbard, P. M. (1996) · ACM Transactions on Graphics · doi:10.1145/231731.231732 · Cited by 491
A Fast Triangle-Triangle Intersection Test
Möller, T. (1997) · Journal of Graphics Tools · doi:10.1080/10867651.1997.10487472 · Cited by 462
Improved Computational Methods for Ray Tracing
Weghorst, H., Hooper, G., & Greenberg, D. P. (1984) · ACM Transactions on Graphics · doi:10.1145/357332.357335 · Cited by 359
Rapid collision detection by dynamically aligned DOP-trees
Zachmann, G. (1998) · IEEE Conference on Virtual Reality and 3D User Interfaces (VR) · doi:10.1109/vrais.1998.658428 · Cited by 155
Shoemake, K. (1992) · Graphics Gems III (IBM Version) · doi:10.1016/b978-0-08-050755-2.50036-1 · Cited by 142
Using EIS to respond to dynamic business conditions
Volonino, L., Watson, H. J., & Robinson, S. (1995) · Decision Support Systems · doi:10.1016/0167-9236(94)00005-d · Cited by 56
Cited by
Collision Detection for Deformable Objects
Teschner, M., Kimmerle, S., Heidelberger, B., Zachmann, G., Raghupathi, L., Fuhrmann, A., Cani, M. ‐., Faure, F., Magnenat‐Thalmann, N., Strasser, W., et al. (2005) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2005.00829.x · Cited by 507
Charbonnier, C., Duthon, V. B., Chagué, S., Kolo, F. C., & Ménétrey, J. (2020) · International Journal of Computer Assisted Radiology and Surgery · doi:10.1007/s11548-019-02107-9 · Cited by 6
Metadata
- Authors
- Bergen, G. V. D.
- Venue
- Journal of Graphics Tools
- Publisher
- Informa UK Limited
- Published
- 1997-01
- Volume
- 2
- Issue
- 4
- Pages
- 1-13
- ISSN
- 1086-7651 (ISSN-L)
- OpenAlex
- W2123703543
- Cited by
- 801
- References
- 8
- FWCI
- 2.31
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient Collision Detection of Complex Deformable Models using AABB Trees. https://app.cochat.ai/papers/10.1080/10867651.1997.10487480
- The paper
- Bergen, G. V. D. (1997). Efficient Collision Detection of Complex Deformable Models using AABB Trees. Journal of Graphics Tools. https://doi.org/10.1080/10867651.1997.10487480
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
