All geek questions in one place

Algorithm for connecting geometric lines

I have n open geometric lines in 3D. which must be combined into one line, based on the criteria for the minimum length of additional lines between the end points of the lines. Please suggest an algorithm that has minimal complexity.

+3
source share
1 answer

The most famous algorithm works in O (2 n ) time. As Andrew Said said in his comment, this is a more general version of the salesman problem. If you find the best algorithm, you will be awarded a prize of $ 100,000.

, . wikipedia.

+1

Source: https://habr.com/ru/post/1776436/

More articles:


All Articles