The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
I-COLLIDE: an interactive and exact collision detection system for large-scale environments
Open accessAbstract
we present an exact and interactive collision detection system, I-COLLIDE, for large-scale environments. Such environments are characterized by the number of objects undergoing rigid motion and the complexity of the models. The algorithm does not assume the objects' motions can be expressed as a closed form function of time. The collision detection system is general and can be easily interfaced with a variety of applications. The algorithm uses a two-level approach based on pruning multiple-object pairs using bounding boxes and performing exact collision detection between selected pairs of polyhedral models. We demonstrate the performance of the system in walkthrough and simulation environments consisting of a large number of moving objects. In particular, the system takes less than 1/20 of a second to determine all the collisions and contacts in an environment consisting of more than 1000 moving polytopes, each consisting of more than 50 faces on an HP-9000/750.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Latombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
Computational geometry. an introduction
Preparata, F. P., & Shamos, M. I. (1985) · Cited by 2,488
A fast procedure for computing the distance between complex objects in three-dimensional space
Gilbert, E. G., Johnson, D. W., & Keerthi, S. S. (1988) · IEEE Journal on Robotics and Automation · doi:10.1109/56.2083 · Cited by 1,513
Collision Detection and Response for Computer Animation
Moore, M., & Wilhelms, J. (1988) · ACM SIGGRAPH Computer Graphics · doi:10.1145/378456.378528 · Cited by 678
Geometric intersection problems
Shamos, M. I., & Hoey, D. (1976) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1976.16 · Cited by 584
Autonomy, Interaction, and Presence
Zeltzer, D. (1992) · Presence: Teleoperators and Virtual Environments · doi:10.1162/pres.1992.1.1.127 · Cited by 407
Realistic animation of rigid bodies
Hahn, J. K. (1988) · ACM SIGGRAPH Computer Graphics · doi:10.1145/378456.378530 · Cited by 351
Efficient collision detection for animation and robotics
Lin, M. C., & Canny, J. (1993) · Cited by 231
Self-citationSet operations on polyhedra using binary space partitioning trees
Thibault, W. C., & Naylor, B. F. (1987) · ACM SIGGRAPH Computer Graphics · doi:10.1145/37402.37421 · Cited by 231
Curved surfaces and coherence for non-penetrating rigid body simulation
Baraff, D. (1990) · Proceedings of the 17th annual conference on Computer graphics and interactive techniques · doi:10.1145/97879.97881 · Cited by 204
Interactive collision detection
Hubbard, P. M. (1993) · Proceedings of 1993 IEEE Research Properties in Virtual Reality Symposium · doi:10.1109/vrais.1993.378267 · Cited by 197
Collision detection by four-dimensional intersection testing
Cameron, S. (1990) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.56661 · Cited by 190
A new approach to rectangle intersections part I
Edelsbrunner, H. (1983) · International Journal of Computer Mathematics · doi:10.1080/00207168308803364 · Cited by 175
Solving the collision detection problem
Garcia-Alonso, A., Serrano, N., & Flaquer, J. (1994) · IEEE Computer Graphics and Applications · doi:10.1109/38.279041 · Cited by 159
Curved surfaces and coherence for non-penetrating rigid body simulation
Baraff, D. (1990) · ACM SIGGRAPH Computer Graphics · doi:10.1145/97880.97881 · Cited by 155
Set operations on polyhedra using binary space partitioning trees
Thibault, W. C., & Naylor, B. F. (1987) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/37401.37421 · Cited by 129
Interval methods for multi-point collisions between time-dependent curved surfaces
Snyder, J. M., Woodbury, A. R., Fleischer, K., Currin, B., & Barr, A. H. (1993) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/166117.166158 · Cited by 117
A new approach to rectangle intersections
Edelsbrunner, H. (1983) · International Journal of Computer Mathematics · doi:10.1080/00207168308803365 · Cited by 116
Approximation hierarchies and S-bounds
Cameron, S. (1991) · ACM Symposium on Solid Modeling and Applications · doi:10.1145/112515.112537 · Cited by 47
Incremental Algorithms for Collision Detection Between General Solid Models
Ponamgi, M. K., Manocha, D., & Lin, M. C. (1994) · Cited by 31
Self-citationComputational complexity versus virtual worlds
Pentland, A. (1990) · ACM Symposium on Interactive 3D Graphics (I3D) · doi:10.1145/91385.91444 · Cited by 30
Computational complexity versus virtual worlds
Pentland, A. (1990) · ACM SIGGRAPH Computer Graphics · doi:10.1145/91394.91444 · Cited by 26
Cited by
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
Self-citationEfficient 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
Randomized Kinodynamic Motion Planning with Moving Obstacles
Hsu, D., Kindel, R., Latombe, J.-C., & Rock, S. (2002) · The International Journal of Robotics Research · doi:10.1177/027836402320556421 · Cited by 771
Larrabee: a many-core x86 architecture for visual computing
Seiler, L., Carmean, D., Sprangle, E., Forsyth, T., Abrash, M., Dubey, P., Junkins, S., Lake, A., Sugerman, J., Cavin, R., et al. (2008) · ACM Transactions on Graphics · doi:10.1145/1360612.1360617 · Cited by 771
3D collision detection: a survey
Jiménez, P., Thomas, F., & Torras, C. (2001) · Computers & Graphics · doi:10.1016/s0097-8493(00)00130-8 · Cited by 563
Metadata
- Authors
- Cohen, J. D., Lin, M. C., Manocha, D., & Ponamgi, M.
- Venue
- Proceedings of the 1995 symposium on Interactive 3D graphics - SI3D '95
- Publisher
- ACM Press
- Published
- 1995
- Pages
- 189-ff.
- OpenAlex
- W2094539937
- Cited by
- 628
- References
- 22
- FWCI
- 9.93
- Type
- conference paper
- Language
- en
- Open access
- bronze
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
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.