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

科技回声

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

GitHubTwitter

首页

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

资源链接

HackerNews API原版 HackerNewsNext.js

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

Time of maximum intersection of two moving polygons

35 点作者 nickponline将近 5 年前

2 条评论

_nalply将近 5 年前
I didn&#x27;t read this very carefully, caveat emptor.<p>Just a thought of mine that popped up: This reminds me of branch-and-bound problems because time could be treated as a dimension and polygons are linearly bound spaces in the sense of branch-and-bound.
pierrebai将近 5 年前
The blog talks about many interesting mathematical problems. One strange thing is that there is gap of about four year between his most current entry (jan 2020) and the previous one (oct 2016).
评论 #23715868 未加载