Generalized planar sweeping of polygons

Abstract The determination of the geometry of the swept volume of a moving object is one of the essential steps in applications such as verifying numerical control tool path and collision avoidance. This paper presents an initial step of a general solution to this complex problem. A two-dimensional version of the solution is explained in detail and the implementation is discussed. Specifically, the following problem is solved: Given a polygonal body B and a parameterized configuration specifying its position and orientation for time tϵ [0,1], what is the boundary of the swept area generated by moving B ? The boundary is represented as a sequence of points in the order they are encountered when the boundary is traversed.

[1]  James U. Korein,et al.  A geometric investigation of reach , 1985 .

[2]  ARISTIDES A. G. REQUICHA,et al.  Representations for Rigid Solids: Theory, Methods, and Systems , 1980, CSUR.

[3]  Ming C. Leu,et al.  Geometric Representation of Swept Volumes with Application to Polyhedral Objects , 1990, Int. J. Robotics Res..

[4]  James R. Munkres,et al.  Topology; a first course , 1974 .

[5]  Leonidas J. Guibas,et al.  A kinetic framework for computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[6]  K. K. Wang,et al.  Geometric Modeling for Swept Volume of Moving Solids , 1986, IEEE Computer Graphics and Applications.