Collision Check Algorithm
We will be determining if two linearly moving line segments collide in a certain time period where each of the 4 points has its own velocity
Optimizations
The final step of the collision check involves checking to see if
There are 12 boolean variables that boolean operations are applied to and produce a bool result
We need to find the optimal equation to find the result. We have a working function that can test the answer.
Create a program to brute force this.
To be continued....
Find a way to view the registers: done
Find the relative line segment. We then no longer have to deal with the point.:done
Find the four parameters of the first dot:Done
Organize the c code to be more like the assembly code
Copyright 2004 © Polyart. All rights reserved.