Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: kinetic tournament

Sortuj według:

Ogranicz wyniki do:

Approximate Hotspots of Orthogonal Trajectories

Rudi Ali Gholami

Fundamenta Informaticae

2019

Vol. 167, nr 4

271--285

We study the problem of finding hotspots, i.e. regions, in which a moving entity spends a significant amount of time, for polygonal trajectories. The fastest exact algorithm, due to Gudmundsson, van Kreveld, and Staals (2013) finds an axis-parallel square hotspot of fixed side length in O(n2) for a trajectory with n edges. Limiting ourselves to the case in which the entity moves in a direction parallel either to the x or to the y-axis, we present an approximation algorithm with the time complexity O(n log3 n) and approximation factor 1/2.