Related Experiment Video
Updated: May 29, 2026

High-resolution Single Particle Analysis from Electron Cryo-microscopy Images Using SPHIRE
Published on: May 16, 2017
A refinement of a spherical decomposition algorithm
1Department of Computer and Information Science, Moore School of Electrical Engineering, University of Pennsylvania, Philadelphia, PA 19104; CRIN, C.O. 140, 54047 Nancy Cedex, Franc.
This study refines the O'Rourke-Badler spherical decomposition algorithm, significantly improving computational efficiency. The enhanced algorithm reduces complexity from cubic (O(n3)) to quadratic (O(n2)).
Area of Science:
- Computational geometry
- Computer-aided design (CAD)
Background:
- Spherical decomposition is crucial for complex geometric modeling.
- Existing algorithms like O'Rourke-Badler have high computational complexity.
Purpose of the Study:
- To propose a refined spherical decomposition algorithm.
- To reduce the algorithmic complexity of spherical decomposition.
Main Methods:
- Modification of the O'Rourke-Badler spherical decomposition algorithm.
- Analysis of algorithmic complexity.
Main Results:
- The refined algorithm achieves a complexity of O(n2).
- This represents a significant reduction from the original O(n3) complexity.
Conclusions:
- The proposed refinement offers a more efficient approach to spherical decomposition.
- This advancement has implications for improving performance in CAD and geometric modeling applications.
Related Concept Videos
Spherical Coordinates
Theorems of Pappus and Guldinus: Problem Solving
Volumes of Solids of Revolution
Gauss's Law: Spherical Symmetry
Partial Fractions
Trigonometric Substitution
