[1]
Oh, S. and Leong, H.W. 2021. Edge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths. Proceedings of the International Symposium on Combinatorial Search. 8, 1 (Sep. 2021), 64–72. DOI:https://doi.org/10.1609/socs.v8i1.18427.