[Algorithms] sort and sweep / sweep and prune and just touching objects

[<Pau...@sc...>]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA256

Hi guys,

I'm running into a few issues with my sort and sweep broad-phase 
algorithm. It comes down to bounds in an axis with identical values.

Most of the stuff i've read about using an array based method for sorting 
your axis values say a good optimisation (for the overlap test) is to 
compare bound indices instead of bound values. But in the case where there 
are identical bound values in the axis, this breaks down since some of 
them would be reported as overlapping and some would not depending on 
where they were in the array. Unfortunately this case comes up a lot in 
our game.

So do i need to compare bound values in all cases? Is there another way 
around this?

Cheers, Paul.
**********************************************************************
This email and any files transmitted with it are confidential and intended 
solely for the use of the individual or entity to whom they are addressed. 
If you have received this email in error please notify pos...@sc...
This footnote also confirms that this email message has been checked for 
all known viruses.
Sony Computer Entertainment Europe Limited
Registered Office: 10 Great Marlborough Street, London W1F 7LP, United 
Kingdom
Registered in England: 3277793
**********************************************************************
P Please consider the environment before printing this e-mail

-----BEGIN PGP SIGNATURE-----
Version: PGP Universal 2.9.1 (Build 287)
Charset: US-ASCII

wsBVAwUBSjpRynajGqjtoMHxAQiZ2gf/ZcIToOT/o1LNU4RKP70AZtIbEek2lObO
g1M7VbLNmgP9vRZUIRcr/4kNi9W/o2IIPguTfNYtOiBWZ5N8cVmgwOzF25DUR2Kq
dhF7zPMK5mAZj+e3PBFEJaBwXZFockqBt44ekTV+z4jA3AZfjgvRr+By+oSXc9QU
ym566w1L3pUIfwZaj3b2X7IKVG6GeFitQ2s/21QlFUUSBlw9W0N7Alsl8SKhgqrP
rHfqSjNKtxjR6at3TApMsS73PMXPZjJJxth7uClwnEy53tEbH3TADVjuFU+EYYIZ
qI9dyiqAklFRjir3lI8uwUqJzthzDb5qQZrgNqegORQGB2Z/75Yosw==
=xzS9
-----END PGP SIGNATURE-----