11. Automatically Generated Convex Regions for Agent Navigation in Virtual Worlds
Report a problem or upload filesIf 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.
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 pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !