A simple and powerful method is presented for calculating all areas of intersection that occur when a plane region of arbitrary shape and connectivity overlaps the cells of a rectangular mesh. This procedure has been successfully used in an algorithm for a digital computer,- and details are given for a unique procedure which effectively sidesteps floating point problems associated with machine noise. A simplifying procedure is also outlined for areal mapping of a collection of complex planar configurations onto a rectangular Eulerian mesh.
展开▼