Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments (Q2288106): Difference between revisions

@@ Property / describes a project that uses @@
+BGL
@@ Property / describes a project that uses: BGL / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s41095-015-0018-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2214614915
@@ Property / OpenAlex ID: W2214614915 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3624088
@@ Property / cites work: Q3624088 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3574261
@@ Property / cites work: Q3574261 / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Reach for <i>A</i>*: Efficient Point-to-Point Shortest Path Algorithms
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+A Theorem on Boolean Matrices
@@ Property / cites work: A Theorem on Boolean Matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921666
@@ Property / cites work: Q2921666 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Speed-Up Techniques for Shortest-Path Computations
+Normal rank