Shape casting a capsule against convex polyhedra
Let's say I have a upright capsule shape (swept sphere) that I would like to cast it along a velocity vector. I would like to be able to find the point of contact and a surface normal for any convex shapes it would intersect along this path. I would also like to find the distance the swept caspule traveled to the point of first contact.
Heres a quick diagram of a capsule being casted against a large convex polyhedra (only one face is drawn) 
What kind of algorithm or process could do this? I assume it would be similar to a sphere-cast, but i can't find much on that either.
Since you are considering capsules and convex polyhedra, I suppose you could use something based on GJK. You would get the point of contact and a surface normal during a collision, and the minimum distance between the objects and the associated witness points if there is no collision.
You can also take a look at this publication on Interactive and Continuous Collision Detection for Avatars in Virtual Environments.
- Fastest sort of fixed length 6 int array
- Can hash tables really be O(1)?
- Number of ways to tile a W x H Grid with 2 x 1 and 1 x 2 dominos?
- Brent's cycle detection algorithm
- Is it possible to reduce number of comparisons from O(N^2) to O(N) in brute-force sorting by using multiplication?
- Mathematical explanation of Leetcode question: Container With Most Water
- manhattan skyline cover failing some test cases
- Algorithm for Determining Tic Tac Toe Game Over
- How to show a sodoku solution is unique
- Counting the number of positive integers that are lexicographically smaller than a specific number
- How to analyze time complexity of an algorithm with different running time
- What is the most efficient way of finding all the factors of a number in Python?
- A good way to find a vector perpendicular to another vector?
- Find the max average subarray with length at least k
- What is the complexity of the sorted() function?
- Minimum number of operations for array of numbers to all equal one number
- Implementation for a Monotonic Increasing Queue
- Java, Shifting Elements in an Array
- Differences between backtracking and brute-force search
- Number of partition of `n` into sum of three squares (fast algorithm)
- Big Number Subtraction in C
- If the n-body problem is chaotic, why isn't it used as a RNG?
- Using BFS for Weighted Graphs
- Removing a node in an undirected graph that destroys a path between two other nodes
- Binary search function is correct but it returns undefined
- Algorithm to reverse an array/string only in terms of rotate operations
- Correctness of Deletion algorithm of BST in CLRS
- Time Complexities n(log(n)) and log(n^n)
- How do I find the closest possible sum of an array's elements to a particular value?
- Split on regex (more than a character, maybe variable width) and keep the separator like GNU awk