Fast Fréchet queries (Q1947991)

The authors consider the problem of generating a query structure that approximates the number of subpaths of a polygonal path \(P\) in the plane within Fréchet distance \(\varepsilon\) from a query segment \(Q\). This is motivated from video analysis of team sports, in which players and a ball can be tracked via video cameras and the information of their (sub)paths might be properly represented by the query structure in this paper. Rigorous theories are discussed by the authors on this problem, and they also raise some open questions on this class of problem at the end.