System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Advanced Search

SEARCH GUIDE

Narrow Results

Results: 1 - 1of1

Follow results:

per page:

Sort: Relevance

Context for search term 1Search term 1*

All Dates

LastSelect static range

Custom Range

Select starting monthSelect starting year

Select ending monthSelect ending year

Search name	Searched On	Run search
[in Journal: International Journal of Computational Geometry & Applications] AN... (1)	30 Mar 2025	Run
[Keyword: Failure] AND [All Categories: Climate Change Economics] (1)	30 Mar 2025	Run
[Keyword: Scratch] AND [All Categories: Chemical Engineering] (2)	30 Mar 2025	Run
[Keyword: Rotation] AND [All Journals] (56)	30 Mar 2025	Run
[Keyword: Caltech] AND [All Categories: Neurology / Neuroscience] (1)	30 Mar 2025	Run

articleNo Access
THREE-DIMENSIONAL TOPOLOGICAL SWEEP FOR COMPUTING ROTATIONAL SWEPT VOLUMES OF POLYHEDRAL OBJECTS
- NAKHOON BAEK,
- SUNG-YONG SHIN, and
- KYUNG-Yong CHWA
International Journal of Computational Geometry & Applications01 Apr 2000
Preview Abstract
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^α(n)+T_c), where n is the number of vertices in the original object and T_c is time for handling face cycles. Here, α(n) is the inverse of Ackermann's function.

1