Back to Results
First PageMeta Content
Convex geometry / Topology / Linear algebra / Metric geometry / Gilbert–Johnson–Keerthi distance algorithm / Convex analysis / Vector space / Convex set / Simplex / Algebra / Geometry / Mathematics


A Fast and Robust GJK Implementation for Collision Detection of Convex Objects G INO VAN DEN B ERGEN Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven
Add to Reading List

Document Date: 1999-07-06 15:16:19


Open Document

File Size: 78,30 KB

Share Result on Facebook

Company

BT / Given s A / T s A / /

/

Facility

Software Library / Computing Science Eindhoven University of Technology P.O. Box / /

IndustryTerm

faster using local search / closest-feature algorithm / dot products / defined solutions / collision detection algorithm / distance algorithm / /

Organization

Mathematics and Computing Science Eindhoven University / Wk / Eindhoven University of Technology / ERGEN Department of Mathematics / /

Person

VAN DEN B ERGEN / /

ProgrammingLanguage

C++ / /

Technology

GJK distance algorithm / data caching / caching / Gilbert-Johnson-Keerthi algorithm / closest-feature algorithm / Appendix A. The GJK algorithm / 1 Introduction The Gilbert-Johnson-Keerthi distance algorithm / 5 Algorithm / collision detection algorithm / GJK algorithm / 1 The GJK distance algorithm / /

URL

http /

SocialTag