Game Development Stack Exchange is a question and answer site for professional and independent game developers. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

When sorting an (incremental and persistent) SAP, you generally move extremas left until you run into a smaller/equal extrema, gathering collisions along the way. However, that results in the collisions of end-points being exclusive (equal extrema don't collide). At first, I was thinking of moving left until a smaller (but not equal) extrema is found, but I'm pretty sure that would give incorrect collision results.

If I want equal values to properly collide (and uncollide), how would that handled?

share|improve this question

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.