连接几何线的算法
我有 n 条开放的 3D 几何线。需要根据线端点之间附加线的最小长度的标准将其连接成单线。请建议具有最小复杂度的算法。
I have n open geometric lines in 3D. which need to be joined into a single line based upon the criteria that minimum length of additional lines between the end points of the lines. Please suggest algorithm which have minimum complexity.
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
最著名的算法运行时间为 O(2n)。
正如安德鲁在评论中所说，这是旅行推销员问题的更一般版本。如果您找到更好的算法，您将获得 100 万美元的奖金。
您应该尝试近似解决方案，请参阅wikipedia。
A best known algorithm runs in O(2n) time.
As Andrew Said in his comment, this is a more general version of traveling salesmen problem. If you find a better algorithm you'll be awarded a $1000000 prize.
You should try approximated solutions instead, see wikipedia.