Time of maximum intersection of two moving polygons
nickp.svbtle.com
nickp.svbtle.com
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.