11. Automatically Generated Convex Regions for Agent Navigation in Virtual Worlds

author: D. Hunter Hale, Game Intelligence Group, University of North Carolina at Charlotte
coauthor: G. Michael Youngblood, PARC - Palo Alto Research Center Inc.
published: June 2, 2008,   recorded: June 2008,   views: 3997

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


We demonstrate a new method of decomposing virtual environments into a navigation mesh represented by bounding geometry useful for agent spatial reasoning, path planning, and mobility.

Our method is a fully-automated and tunable growth-based technique for decomposing the world using quads and higher order polygonal shapes. This technique results in decompositions that are generally better than current techniques.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

Comment1 Hunter D. Hale, July 28, 2009 at 1:36 p.m.:

Interesting name!

Write your own review or comment:

make sure you have javascript enabled or clear this field: