The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A fast procedure for computing the distance between complex objects in three-dimensional space
Abstract
An algorithm for computing the Euclidean distance between a pair of convex sets in R/sup m/ is described. Extensive numerical experience with a broad family of polytopes in R/sup 3/ shows that the computational cost is approximately linear in the total number of vertices specifying the two polytopes. The algorithm has special features which makes its application in a variety of robotics problems attractive. These features are discussed and an example of collision detection is given.>
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
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500106 · Cited by 7,894
An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
Gilbert, E. G. (1966) · SIAM Journal on Control · doi:10.1137/0304007 · Cited by 230
Self-citation
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
Approximate convex decomposition for 3D meshes with collision-aware concavity and tree search
Wei, X., Liu, M., Ling, Z., & Su, H. (2022) · ACM Transactions on Graphics · doi:10.1145/3528223.3530103 · Cited by 80
Interference Detection Between Curved Objects for Computer Animation
Lin, M. C., & Manocha, D. (1993) · Models and Techniques in Computer Animation · doi:10.1007/978-4-431-66911-1_4 · Cited by 16
Metadata
- Authors
- Gilbert, E. G., Johnson, D. W., & Keerthi, S. S.
- Venue
- IEEE Journal on Robotics and Automation
- Published
- 1988-04
- Volume
- 4
- Issue
- 2
- Pages
- 193-203
- ISSN
- 0882-4967 (ISSN-L)
- OpenAlex
- W2166316739
- Cited by
- 1,513
- References
- 2
- FWCI
- 7.95
- 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: A fast procedure for computing the distance between complex objects in three-dimensional space. https://app.cochat.ai/papers/10.1109/56.2083
- The paper
- Gilbert, E. G., Johnson, D. W., & Keerthi, S. S. (1988). A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE Journal on Robotics and Automation. https://doi.org/10.1109/56.2083
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.
