TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Ask HN: Point Set Matching

1 点作者 willcodeforfoo超过 1 年前
Can anyone recommend an algorithm that would find a subset of 2D points in a larger set, with outliers. It's a similar problem to the one presented here: https://stackoverflow.com/questions/27823048/good-algorithm-for-finding-subsets-of-point-sets but after all these years I still haven't found a great solution.

暂无评论

暂无评论