In computer graphics systems, cropping applications appear to be quite simple from a human perspective as human eyes can easily visualize whether a portion of the picture is inside or outside. However, from a computational perspective, the problem increases multifold as a simple process involves a large number of comparisons and computations. With the added importance given to floating point numbers, the complexity shoots up exponentially. With this viewpoint in perspective, an analytical model has been designed. This model incorporates algorithms using integral calculations in order to find intermediate intersection points. This in turn would improve cropping objects’ speed in three-dimensional spaces. The performance of this algorithm is expected to be robust and can handle computations at a much higher speed for any size of rectangular parallelepiped cropping windows.