What are the edges of a Mesh navigation graph?

2 replies to this topic

#1Weng

New Member

• Members
• 16 posts

Posted 06 February 2009 - 09:39 AM

I am reading up and am interested in using mesh navigation graphs for path finding.

Given that each mesh represents a node on the navigation graph, what are the edges of the mesh navigation graph?

Also, how are the edge costs of the mesh navigation graph computed?

The diagrams I have seen show the meshes lying adjacent to one another with no edges, unlike the waypoint navigation graph.

#2v71

Valued Member

• Members
• 353 posts

Posted 06 February 2009 - 07:33 PM

Your question is a bit vague, you mean edges inside a mesh or edges between meshes ?
if your question is the latter i would say that an edge connects 2 meshes
given this structure you may employ graph navigation algorithm to select the shortest path between meshes and other algorithms as well, it depends of what you need

#3Weng

New Member

• Members
• 16 posts

Posted 09 February 2009 - 08:38 AM

v71 said:

Your question is a bit vague, you mean edges inside a mesh or edges between meshes ?
if your question is the latter i would say that an edge connects 2 meshes
given this structure you may employ graph navigation algorithm to select the shortest path between meshes and other algorithms as well, it depends of what you need

I am referring to edges between meshes. Can the edges between 2 meshes be represented by a straight line between the 2 centre points of the 2 meshes?

Inside a mesh, since the mesh is a walkable area, it is not necessary to have edges inside a mesh right?

:huh:

1 user(s) are reading this topic

0 members, 1 guests, 0 anonymous users