Abstract
We propose and analyze a global search algorithm for the computation of the minimum zone sphericity (circularity) error of a given set. The formulation is valid in any dimension and covers both finite sets of data points as well as infinite sets like polygonal chains or triangulations of surfaces. We derive theoretical estimates for the cost to reach a desired accuracy, and validate the performance of the algorithm with various numerical experiments.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
