Login / Signup

A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains.

Haitao Wang
Published in: SoCG (2019)
Keyphrases
  • matching algorithm
  • computational complexity
  • special case
  • video sequences
  • np hard
  • multi dimensional