from Hacker News

Time of maximum intersection of two moving polygons

by nickponline on 6/29/20, 2:48 AM with 3 comments

• by _nalply on 6/30/20, 6:35 AM

  I didn't read this very carefully, caveat emptor.

  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.

• by pierrebai on 6/29/20, 8:15 PM

  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).