News for hackers. Stuff that matters.
Re:Time of maximum intersection of two moving polygons by _nalply on Tuesday June 30, 2020 @02:35AM (#23687266)
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.

There are no comments on this comment yet.