A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Probing a Set of Trajectories to Maximize Captured Information
2020
Symposium on Experimental and Efficient Algorithms
We study a trajectory analysis problem we call the Trajectory Capture Problem (TCP), in which, for a given input set T of trajectories in the plane, and an integer k≥ 2, we seek to compute a set of k points ("portals") to maximize the total weight of all subtrajectories of T between pairs of portals. This problem naturally arises in trajectory analysis and summarization. We show that the TCP is NP-hard (even in very special cases) and give some first approximation results. Our main focus is on
doi:10.4230/lipics.sea.2020.5
dblp:conf/wea/FeketeHKMMPP20
fatcat:bw4jzh4bwzawlp5tpiiur44cwq