Year-end Sale % OFF 
Abstract
The problem of finding the optimal location of moving bodies in three-dimensional Euclidean space is considered. We study the problem of finding such a position for two given polytopes A and B at which the Hausdorff distance between them would be minimal. To solve it, the apparatus of convex and nonsmooth analysis is used, as well as methods of computational geometry. Iterative algorithms have been developed and justification has been made for the correctness of their work. A software package has been created, its work is illustrated with specific examples.
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 callMore From: Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta
Disclaimer: 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.
