Plane sweep plays an important role in computational geometry. This paper shows that an extension of topological plane sweep to three-dimensional space can calculate the Volume swept by rotating a solid polyhedral object about a fixed axis. Analyzing the characteristics of rotational swept volumes, we present an incremental algorithm based on the three-dimensional topological sweep technique. Our solution shows the time bound of O(n(2) . 2(alpha(n)) + T-c), where n Is the number of vertices in the original object and T-c is time for handling face cycles. Here, a(n) is the inverse of Ackermann's function.