Multi-body problems have many objects that could be colliding
Most common case in games is lots of players or agents "Collision" may not mean intersecting, could just mean being close enough to react
It is essent
Groups of up to 2
Visualize Kirkpatricks or Trapezoidal Point Location.
Show all comparisons (in every level of the tree).
Run on different kinds of points (random, randomly on a circle, etc), an
Data Structures for Mobile Data
Key concepts are that geometric constructs (convex hull, delauney triangulation, etc.) are defined based on "simple" geometric properties. The simple properties can be verified with certific
Convex Hull Brute Force Inside(q,abc) Intersect(ab,cd) Orient(a,b,c).
More efficient convex hull algorithms and absolute bounds. Two (of many) algorithms. One (of one) interesting reduction.
At the end of the last class,
More specific reprise
Several convex hull algorithms.
Lower bound of O(n log n)
O(n log h) for output sensitive.
Jarvis March: O(n h)
Grahams Scan: O(n log n)
Sort: O(n log n)
Create the Hull: O(n)
Chans Algorithm: An optimal O(n