Jump to content

  • Log In with Google      Sign In   
  • Create Account

Banner advertising on our site currently available from just $5!


1. Learn about the promo. 2. Sign up for GDNet+. 3. Set up your advert!


#ActualRegistred

Posted 24 May 2014 - 12:52 PM

Hey there,

 

I'm currently trying to implement a navigation mesh that can be updated in real-time.

A well known paper for this issue is:

 

http://www.staff.science.uu.nl/~gerae101/motion_planning/dynamic_navmesh.html

 

This method requires you to build a navigation mesh by constructing a medial axis and then update the medial axis at runtime.

 

I was wondering if techniques exist that split the polygons of the navigation mesh itself, but wasn't able to find anything on the web.

Now, i ran into an article in the book "AI Game Programming Wisdom 4" called "Dynamically Updating a Navigation Mesh via Efficient Polygon Subdivision" by Paul Marden and Forrest Smith, but unfortunately this book is out of print and costs about 400$ as a used copy.

I'm a student and can't afford this, but this article really seems to be what I've been looking for for days. 

 

Are there any papers that describe a similar algorithm by subdividing the polygons of a navigation mesh? Does anyone have this book and could describe the overall algorithm that is used?

 

Greetings!


#1Registred

Posted 24 May 2014 - 08:01 AM

Hey there,

 

I'm currently trying to implement a navigation mesh that can be updated in real-time.

A well known paper for this issue is:

 

http://www.staff.science.uu.nl/~gerae101/motion_planning/dynamic_navmesh.html

 

This method requires you to build a navigation mesh by constructing a medial axis and then update the medial axis at runtime.

 

I was wondering if techniques exist that split the polygons of the navigation mesh itself, but wasn't able to find anything on the web.

Now, i ran into an article in the book "AI Game Programming Gems 4" called "Dynamically Updating a Navigation Mesh via Efficient Polygon Subdivision" by Paul Marden and Forrest Smith, but unfortunately this book is out of print and costs about 400$ as a used copy.

I'm a student and can't afford this, but this article really seems to be what I've been looking for for days. 

 

Are there any papers that describe a similar algorithm by subdividing the polygons of a navigation mesh? Does anyone have this book and could describe the overall algorithm that is used?

 

Greetings!


PARTNERS