The Medial Axis of a Multi-Layered Environment and its Application as a Navigation Mesh
Files
Publication date
2018-06
Editors
Advisors
Supervisors
Document Type
Article
Metadata
Show full item recordCollections
License
taverne
Abstract
Path planning for walking characters in complicated virtual environments is a fundamental task in simulations and games. A navigation mesh is a data structure that allows efficient path planning. The Explicit Corridor Map (ECM) is a navigation mesh based on the medial axis. It enables path planning for disk-shaped characters of any radius. In this paper, we formally extend the medial axis (and therefore the ECM) to 3D environments in which characters are constrained to walkable surfaces. Typical examples of such environments are multi-storey buildings, train stations, and sports stadiums. We give improved definitions of a walkable environment (WE: a description of walkable surfaces in 3D) and a multi-layered environment (MLE: a subdivision of a WE into connected layers). We define the medial axis of such environments based on projected distances on the ground plane. For an MLE with n boundary vertices and k connections, we show that the medial axis has size O(n), and we present an improved algorithm that constructs the medial axis in O(n log n log k) time. The medial axis can be annotated with nearest-obstacle information to obtain the ECM navigation mesh. Our implementations show that the ECM can be computed efficiently for large 2D and multi-layered environments, and that it can be used to compute paths within milliseconds. This enables simulations of large virtual crowds of heterogeneous characters in real-time.
Keywords
Theory of computation, Computational geometry, Computing methodologies, Mesh geometry models, Modeling and simulation, Mathematics of computing, Geometric topology, Taverne
Citation
van Toll, W G, Cook IV, A F, van Kreveld, M J & Geraerts, R J 2018, 'The Medial Axis of a Multi-Layered Environment and its Application as a Navigation Mesh', ACM Transactions on Spatial Algorithms and Systems, vol. 4, no. 1, 2. https://doi.org/10.1145/3204456