In fact, the shape should not be that strange at all. It's just a half-circle per intersection point, is it not?
I suppose you could use an in-rectangle test (rectangle around the two intersection points, expanded by the radius of the test sphere) combined with a not-in-circle test (around each of the two intersection points) to build a somewhat simple in-corridor test.
Combined with some early out tests, that should be quite efficient.

Regards, Marius

On Wed, May 26, 2010 at 4:58 PM, <> wrote:
Hash: SHA256

> Assuming you have a choice in the method, would it not be easier to
> use the interior of any circles as walkable space, rather than the
> unions, and construct 'portals' between the line formed between the
> intersection points of each overlapping circle? Alternatively to
> reduce the number of circles significantly, circles can represent
> walkable space, circles can be explicitly linked together, and it
> could be assumed that the corridor built between the circles along
> their tangents is valid walkable space as well.

Hi Jeremy

I think the trouble with this idea is the shape of the corridors - in
actual fact, they're not rectangular they're strange curvy funnel shapes.
I'd be worried that simplifying assumption would lead to problems :)

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
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
Registered in England: 3277793
P Please consider the environment before printing this e-mail

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



GDAlgorithms-list mailing list