Skip to search form
Skip to main content
>Semantic ScholarSemantic Scholars Logo
Search
Sign In
Create Free Account
You are currently offline. Some features of the site may not work correctly.
DOI:10.1109/ROBOT.1994.351059Corpus ID: 10714019
Efficient distance computation between non-convex objects
S. Quinlan
Published 1994
Mathematics, Computer Science
Proceedings of the 1994 IEEE International Conference on Robotics and Automation
This paper describes an efficient algorithm for computing the distance between nonconvex objects. Objects are modeled as the union of a set of convex components. From this model we construct a hierarchical bounding representation based on spheres. The distance between objects is determined by computing the distance between pairs of convex components using preexisting techniques. The key to efficiency is a simple search routine that uses the bounding representation to ignore most of the possibleCONTINUE READING
View on IEEE
ai.stanford.edu
Save to Library
Create Alert
Cite
Launch Research Feed
Figures and Topics from this paper
Figures
Figure 1
Figure 2
Explore Further: Topics Discussed in This Paper
Computation
Algorithm
Approximation error
470 Citations
Publication Type
Author
More Filters
Sort by RelevanceSort by Most Influenced PapersSort by Citation CountSort by Recency
An incremental version of growth distance
C. J. Ong, Eugene HuangMathematics, Computer ScienceProceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146)19989
Save
Alert
Research Feed
Computing distances between surfaces using line geometry
Kyung-Ah Sohn, B. Jttler, M. Kim, W. WangMathematics, Computer Science10th Pacific Conference on Computer Graphics and Applications, 2002. Proceedings.200216PDF
View 1 excerpt, cites background
Save
Alert
Research Feed
Computing the Distance Between Two Surfaces via Line Geometry
Kyung-Ah Sohn, B. Jttler, M. Kim, W. Wang20026PDF
View 2 excerpts, cites background
Save
Alert
Research Feed
Fast convex minimization to detect collisions between polyhedra
C. Mirolo, E. PagelloComputer ScienceProceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113)20005
View 1 excerpt, cites background
Save
Alert
Research Feed
A fast growth distance algorithm for incremental motions
C. J. Ong, Eugene Huang, Sun-Mog HongMathematics, Computer ScienceIEEE Trans. Robotics Autom.20005PDF
View 1 excerpt, cites background
Save
Alert
Research Feed
Adaptive medial-axis approximation for sphere-tree construction
G. Bradshaw, C. OSullivanMathematics, Computer ScienceTOGS2004196PDF
View 2 excerpts, cites methods and background
Save
Alert
Research Feed
Fast and accurate collision detection based on enclosed ellipsoid
M. Ju, J. Liu, Shen-Po Shiang, Yuh-Ren Chien, K. Hwang, Wan-Chi LeeMathematics, Computer ScienceRobotica200117PDF
View 1 excerpt, cites background
Save
Alert
Research Feed
Exact distance computation for deformable objects
Marc Gissler, U. Frese, Matthias Teschner20086PDF
View 1 excerpt, cites background
Save
Alert
Research Feed
The nearest point problem in a polyhedral set and its extensions
Zhe Liu, Y. FathiMathematics, Computer ScienceComput. Optim. Appl.20126
Save
Alert
Research Feed
An Accurate Distance-Calculation Algorithm for Convex Polyhedra
E. Dyllong, W. Luther, W. OttenComputer Science, MathematicsSCAN19985
Save
Alert
Research Feed
1
2
3
4
5
References
SHOWING 1-10 OF 27 REFERENCES
SORT BY
RelevanceMost Influenced PapersRecency
A fast algorithm for incremental distance calculation
M. Lin, J. CannyMathematics, Computer ScienceProceedings. 1991 IEEE International Conference on Robotics and Automation1991552PDF
View 3 excerpts, references background
Save
Alert
Research Feed
A fast procedure for computing the distance between complex objects in three-dimensional space
E. Gilbert, D. W. Johnson, S. KeerthiComputer ScienceIEEE J. Robotics Autom.19881,222PDF
View 1 excerpt, references background
Save
Alert
Research Feed
A Direct Minimization Approach for Obtaining the Distance between Convex Polyhedra
James E. BobrowMathematics, Computer ScienceInt. J. Robotics Res.1989117
View 4 excerpts, references background
Save
Alert
Research Feed
Efficient collision detection for animation and robotics
M. Lin, J. CannyMathematics1993311
Save
Alert
Research Feed
Determining the Separation of Preprocessed Polyhedra A Unified Approach
D. Dobkin, D. KirkpatrickComputer ScienceICALP1990243
Save
Alert
Research Feed
OBBTree: a hierarchical structure for rapid interference detection
Stefan Gottschalk, M. Lin, D. ManochaComputer ScienceSIGGRAPH19961,827PDF
Save
Alert
Research Feed
Approximating polyhedra with spheres for time-critical collision detection
Philip M. HubbardComputer ScienceTOGS1996543PDF
Save
Alert
Research Feed
I-COLLIDE: an interactive and exact collision detection system for large-scale environments
J. Cohen, M. Lin, D. Manocha, Madhav K. PonamgiComputer ScienceI3D 951995778PDF
Save
Alert
Research Feed
Hierarchical object models for efficient anti-collision algorithms
B. FaverjonComputer ScienceProceedings, 1989 International Conference on Robotics and Automation198942
View 1 excerpt
Save
Alert
Research Feed
A new representation for collision avoidance and detection
A. P. Pobil, Miguel A. Serna, Juan LlovetMathematics, Computer ScienceProceedings 1992 IEEE International Conference on Robotics and Automation199256
View 1 excerpt, references methods
Save
Alert
Research Feed
1
2
3
Related Papers
AbstractFigures and Topics470 Citations27 ReferencesRelated Papers
Stay Connected With Semantic Scholar
Sign Up
About Semantic Scholar
Semantic Scholar is a free, AI-powered research tool for scientific literature, based at the Allen Institute for AI.
Learn More
Resources
DatasetsSupp.aiAPIOpen Corpus
Organization
About UsResearchPublishing PartnersData Partners
FAQContact
Proudly built by AI2 with the help of our Collaborators
Terms of ServicePrivacy Policy
The Allen Institute for AI
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE
Reviews
There are no reviews yet.