Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments

DOI10.1007/s41095-015-0018-0zbMath1428.68328OpenAlexW2214614915MaRDI QIDQ2288106

Nicholas Mario Wardhana, Henry Johan, Hock Soon Seah

Publication date: 17 January 2020

Published in: Computational Visual Media (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41095-015-0018-0

zbMATH Keywords

abstractionmotion typespath planning accelerationvery large environments

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Uses Software

• Boost
• BGL
• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Speed-Up Techniques for Shortest-Path Computations
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
• Algorithms – ESA 2005
• Experimental and Efficient Algorithms
• Experimental and Efficient Algorithms
• A Theorem on Boolean Matrices
• Algorithms - ESA 2003

This page was built for publication: Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments