When is O$($n$2)$ considered a costly algorithm? Is there a less costly alternative?

Hint: Find the answer among algorithms with difficulty of O$($n$),$ O$($log n$),$ O$($nn$),...$

Why does overlap testing have a degree of error?

Does overlap testing work for small objects? Why or why not?

When overlap testing is performed, does it always take five iterations of the bisection technique to detect the time right before collision?

What are the limitations of intersection testing?

Explain the Minkowski sum.

In Figure $4\mathrm{.}2\mathrm{.}9$ of the textbook, what is the exact number of tests performed to determine if any two $($or more$)$ objects collide?

If we double the size of the grids in Figure $4\mathrm{.}2\mathrm{.}9,$ what is the exact number of tests needed to determine if there is a collision?