also since each object is a rigid body each point in any one object will have the same equation of motion.
On Wed, Feb 16, 2011 at 8:04 PM, Ashim Kapoor <[email protected]> wrote: > Here is my "attempt" it's very naive but maybe someone can improve > > each object be a pointer to a set of points { these points are the boundary > of the object } > > Collision detection : Sweep through each pair of pointers to check for > equality of the boundary points. > > an example , there are 3 objects a1,a2,a3. > > a1={p1,p2,....,pn} > a2={q1,....,qn1} > a3={r1,...,rn2} > > for each pair ai,aj we have to check if any 2 points in the corressponding > lists are equal > > the question then becomes What is the fastest way to compare through n > arrays. > > I dont have a sophisticated way of doing this. Maybe someone can help me ? > > > > On Wed, Feb 16, 2011 at 5:29 PM, bittu <[email protected]> wrote: > >> many irregular shape objects are moving in random direction. provide >> data structure and algo to detect collision. Remember that objects are >> in million. >> >> Thanks >> Shashank >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
