• Korean Journal of Computational Design and Engineering
• /
• v.4 no.2
• /
• pp.162-171
• /
• 1999

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?+T?), where n is the number of vertices in the original object and T? is time for handling face cycles. Here, α(n) is the inverse of Ackermann's function.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1617-1622
• /
• 1991

Plane sweep is a general method in computational geometry. There are many efficient theoretical algorithms designed using plane sweep technique. However, their practical implementations are still suffering from the topological inconsistencies resulting from the numerical errors in geometric computations with finite-precision arithmetic. In this paper, we suggest new implementation techniques for the plane sweep algorithms to resolve the topological inconsistencies and construct the planar object boundaries from given input curve segments.