The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
BD-tree: output-sensitive collision detection for reduced deformable models
Abstract
We introduce the Bounded Deformation Tree, or BD-Tree, which can perform collision detection with reduced deformable models at costs comparable to collision detection with rigid objects. Reduced deformable models represent complex deformations as linear superpositions of arbitrary displacement fields, and are used in a variety of applications of interactive computer graphics. The BD-Tree is a bounding sphere hierarchy for output-sensitive collision detection with such models. Its bounding spheres can be updated after deformation in any order, and at a cost independent of the geometric complexity of the model; in fact the cost can be as low as one multiplication and addition per tested sphere, and at most linear in the number of reduced deformation coordinates. We show that the BD-Tree is also extremely simple to implement, and performs well in practice for a variety of real-time and complex off-line deformable simulation examples.
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
Cited by
James, D. L., & Twigg, C. D. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073206 · Cited by 361
Self-citation
Metadata
- Authors
- James, D. L., & Pai, D. K.
- Venue
- ACM Transactions on Graphics
- Published
- 2004-08
- Volume
- 23
- Issue
- 3
- Pages
- 393-398
- ISSN
- 0730-0301 (ISSN-L)
- 1557-7368
- OpenAlex
- W1987729351
- Cited by
- 208
- References
- 1
- FWCI
- 44.99
- 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: BD-tree: output-sensitive collision detection for reduced deformable models. https://app.cochat.ai/papers/10.1145/1015706.1015735
- The paper
- James, D. L., & Pai, D. K. (2004). BD-tree: output-sensitive collision detection for reduced deformable models. ACM Transactions on Graphics. https://doi.org/10.1145/1015706.1015735
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.