Smallest Enclosing Sphere in 3D -- Particle Swarm Optimization Approach

Abstract

We have employed Particle Swarm Optimization to address a stochastic variant of the Smallest Enclosing Sphere estimation problem. An efficient algorithm has been developed to ascertain the optimal center and radius of a sphere encompassing a cloud of points within a three-dimensional space. Our findings are benchmarked against simulated scenarios of the classical problem. Additionally, we elucidate several benefits of our proposed algorithm over Welzl's Algorithm.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…