Here we examine an algorithm that computes the pair of points that are closest to each other while still being inside each of a pair of polygons. The name of the algorithm that solves this problem is called the Lemke Algorithm. The Lemke Algorithm is able to solve a set of simultaneous equations that define mathematically the set of constraints described above. … Continue reading …
Archives
Categories
- Collision Detection (3)
- Experiments (10)
- Particles (4)
- Physics (2)
- Polygons (4)
- Selected Projects (3)
Blogroll
Here we continue our exploration of polygons, and specifically the projection of their extreme vertices on an arbitrary line or axis. What do I mean by extreme vertices? I mean the pair of vertices that are the most nearly aligned with a given line or axis. How do we determine that pair of vertices? …