A navigation mesh for dynamic environments

Authors:
Wouter G. van Toll;Atlas F. Cook;Roland Geraerts
Affiliations:
Department of Information and Computing Sciences, Utrecht University, 3584 CC Utrecht, The Netherlands;Department of Information and Computing Sciences, Utrecht University, 3584 CC Utrecht, The Netherlands;Department of Information and Computing Sciences, Utrecht University, 3584 CC Utrecht, The Netherlands
Venue:
Computer Animation and Virtual Worlds
Year:
2012

Citing 17
Cited 1

A sweepline algorithm for Voronoi diagrams

SCG '86 Proceedings of the second annual symposium on Computational geometry
Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
On deletion in Delaunay triangulations

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Fast computation of generalized Voronoi diagrams using graphics hardware

Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Delete and insert operations in Voronoi/Delaunay methods and applications

Computers & Geosciences
AI Game Programming Wisdom, Vol. 2

AI Game Programming Wisdom, Vol. 2
The visibility-Voronoi complex and its applications

Computational Geometry: Theory and Applications - Special issue on the 21st European workshop on computational geometry (EWCG 2005)
Real-time navigation of independent agents using adaptive roadmaps

Proceedings of the 2007 ACM symposium on Virtual reality software and technology
Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications
Closest-point problems

SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments

Computer-Aided Design
A Predictive Collision Avoidance Model for Pedestrian Simulation

MIG '09 Proceedings of the 2nd International Workshop on Motion in Games
Shortest paths with arbitrary clearance from navigation meshes

Proceedings of the 2010 ACM SIGGRAPH/Eurographics Symposium on Computer Animation
Dynamic Voronoi diagram of complex sites

The Visual Computer: International Journal of Computer Graphics - CGI'2011 Conference
Automatic generation of suboptimal navmeshes

MIG'11 Proceedings of the 4th international conference on Motion in Games
Dynamic Voronoi diagrams

IEEE Transactions on Information Theory
Real-time density-based crowd simulation

Computer Animation and Virtual Worlds

Technical Section: NEOGEN: Near optimal generator of navigation meshes for 3D multi-layered environments

Computers and Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Games and simulations frequently model scenarios where obstacles move, appear, and disappear in an environment. A city environment changes as new buildings and roads are constructed, and routes can become partially blocked by small obstacles many times in a typical day. This paper studies the effect of using local updates to repair only the affected regions of a navigation mesh in response to a change in the environment. The techniques are inspired by incremental methods for Voronoi diagrams. The main novelty of this paper is that we show how to maintain a 2D or 2.5D navigation mesh in an environment that contains dynamic polygonal obstacles. Experiments show that local updates are fast enough to permit real-time updates of the navigation mesh. Copyright © 2012 John Wiley & Sons, Ltd.