Abstract
The method for detecting interference between any two simple polygons was presented. The algorithm to solve maximum movable distance and collision time before collision for two simple translational polygons in a plane were proposed. The procedure of the algorithm was given, and the time complexity of the algorithm was analyzed. The simulation result has shown that the algorithm is stable and effective.
| Original language | English |
|---|---|
| Pages (from-to) | 561-566 |
| Number of pages | 6 |
| Journal | Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University |
| Volume | 17 |
| Issue number | 4 |
| State | Published - Nov 1999 |