近似不连续轨迹热点
Approximate Discontinuous Trajectory Hotspots
摘要:
热点是具有固定边长$s$的轴对齐的正方形,固定边长是实体在其中最大化的平面中移动的存在的持续时间。在$O(n^2)$中可以找到具有$n$边的多边形轨迹的精确热点。定义一个$c$ -近似热点作为一个轴对齐的正方形边长$cs$,其中实体的存在的持续时间不小于一个确切的热点,在本文中,我们提出了一个算法来寻找一个$(1 + ε)$ -近似热点的多边形轨迹的时间复杂度为$O({nϕ\over ε} \log {nϕ\over ε})$,其中$ϕ$是平均轨迹边长度与$s$的比值。
英文摘要:
A hotspot is an axis-aligned square of fixed side length $s$, the duration of the presence of an entity moving in the plane in which is maximised. An exact hotspot of a polygonal trajectory with $n$ edges can be found in $O(n^2)$. Defining a $c$-approximate hotspot as an axis-aligned square of side length $cs$, in which the duration of the entity's presence is no less than that of an exact hotspot, in this paper we present an algorithm to find a $(1 + ε)$-approximate hotspot of a polygonal trajectory with the time complexity $O({nϕ\over ε} \log {nϕ\over ε})$, where $ϕ$ is the ratio of average trajectory edge length to $s$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。