TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Time of maximum intersection of two moving polygons

35 pointsby nickponlinealmost 5 years ago

2 comments

_nalplyalmost 5 years ago
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.
pierrebaialmost 5 years ago
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 未加载