Approximate Discontinuous Trajectory Hotspots

01/07/2019
by   Ali Gholami Rudi, et al.
0

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ϕϵnϕϵ), where ϕ is the ratio of average trajectory edge length to s.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/10/2017

Time-Windowed Contiguous Hotspot Queries

A hotspot of a moving entity is a region in which it spends a significan...
research
10/14/2017

Approximate Hotspots of Orthogonal Trajectories

In this paper we study the problem of finding hotspots of polygonal two-...
research
07/19/2023

Efficient Non-Learning Similar Subtrajectory Search

Similar subtrajectory search is a finer-grained operator that can better...
research
09/01/2023

A Massively Parallel Dynamic Programming for Approximate Rectangle Escape Problem

Sublinear time complexity is required by the massively parallel computat...
research
10/22/2021

On the Necessity of Auditable Algorithmic Definitions for Machine Unlearning

Machine unlearning, i.e. having a model forget about some of its trainin...
research
05/30/2019

Largest Inscribed Rectangles in Geometric Convex Sets

We consider the problem of finding inscribed boxes and axis-aligned insc...
research
03/21/2018

Looking for Bird Nests: Identifying Stay Points with Bounded Gaps

A stay point of a moving entity is a region in which it spends a signifi...

Please sign up or login with your details

Forgot password? Click here to reset