Login / Signup
A Divide-and-Conquer Algorithm for Two-Point L1 Shortest Path Queries in Polygonal Domains.
Haitao Wang
Published in:
J. Comput. Geom. (2020)
Keyphrases
</>
np hard
computational complexity
special case
databases
knowledge representation
np complete
tree structure