math - Collision detection. big object against small object -


i have troubles collision detection.

for n objects similar size can iterate on each object , search nearest vertex of object detect collision (with kd-tree in o(n*log(n))). when have big plane , small object, fails, because vertices of plane far away. common approach solve problem?


Comments

Popular posts from this blog

android - InAppBilling registering BroadcastReceiver in AndroidManifest -

python Tkinter Capturing keyboard events save as one single string -

sql server - Why does Linq-to-SQL add unnecessary COUNT()? -