Path-Finding

New Message Reply Date view Thread view Subject view Author view

Jeremy Townsend (paradoxgames++at++mindspring.com)
Mon, 23 Mar 1998 22:41:18 -0600

Hi, we are developing a 3D "game" of sorts using Performer that relies
heavily on pathfinding (i.e. finding the shortest route between point A and
point B on the surface of our terrain geometry). In 2D this is an easy
problem, but the 3D terrain in question is extremely varied and intricate.

One approach we tried was to create a list of spheres over the entire
terrain and link them in a logical order (i.e. to get to specific
coordinate in sphere Z from coordinates in sphere X, proceed through
spheres X->Y->Z then move to specified coordinates in Z.) While efficient,
the set up is a hassle (100s of spheres, drawn and linked by hand), and it
tends to crash when we use more than 20 spheres.

Another approach was to break down everything into a standard 2D array, but
the arrays would be so large as to be completely unmanageable.

Anyway, my question is: Has anyone tried to do accurate 3D pathfinding?
Could you send some ideas our way please?

Thank you!

Jeremy Townsend
=======================================================================
List Archives, FAQ, FTP: http://www.sgi.com/Technology/Performer/
            Submissions: info-performer++at++sgi.com
        Admin. requests: info-performer-request++at++sgi.com

New Message Reply Date view Thread view Subject view Author view

This archive was generated by hypermail 2.0b2 on Mon Aug 10 1998 - 17:57:04 PDT

This message has been cleansed for anti-spam protection. Replace '++at++' in any mail addresses with the '@' symbol.