A navigation mesh for dynamic environments

被引:31
作者
van Toll, Wouter G. [1 ]
Cook, Atlas F. [1 ]
Geraerts, Roland [1 ]
机构
[1] Univ Utrecht, Dept Informat & Comp Sci, NL-3584 CC Utrecht, Netherlands
关键词
navigation mesh; dynamic environments; medial axis; Voronoi diagram;
D O I
10.1002/cav.1468
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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 (c) 2012 John Wiley & Sons, Ltd.
引用
收藏
页码:535 / 546
页数:12
相关论文
共 32 条
[1]  
[Anonymous], 2000, Spatial tessellations: concepts and applications of Voronoi diagrams
[2]  
[Anonymous], 1975, P 16 ANN IEEE S FDN
[3]  
De Berg M., 2008, Computational Geometry: Algorithms and Applications, V17
[4]  
de Moura Pinto F, 2011, VISUAL COMPUTER INT, V27, P463
[5]  
Devillers O., 1999, Proceedings of the Fifteenth Annual Symposium on Computational Geometry, P181, DOI 10.1145/304893.304969
[6]  
Fortune S., 1986, Proc. Second Ann. Symp. Comput. Geom. SCG New York, V86, P313
[7]  
Gayle R, 2007, 2007 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-9, P3783
[8]   Planning Short Paths with Clearance using Explicit Corridors [J].
Geraerts, Roland .
2010 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2010, :1997-2004
[9]   DYNAMIC VORONOI DIAGRAMS [J].
GOWDA, IG ;
KIRKPATRICK, DG ;
LEE, DT ;
NAAMAD, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (05) :724-731
[10]   COMPUTING DIRICHLET TESSELLATIONS IN PLANE [J].
GREEN, PJ ;
SIBSON, R .
COMPUTER JOURNAL, 1978, 21 (02) :168-173