Applications of parametric searching in geometric optimization
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
On the area of overlap of translated polygons
Computer Vision and Image Understanding
Trajectory clustering with mixtures of regression models
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Introduction to algorithms
Discovering Similar Multidimensional Trajectories
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Time-focused clustering of trajectories of moving objects
Journal of Intelligent Information Systems
Trajectory clustering: a partition-and-group framework
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Exact indexing of dynamic time warping
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
A model for enriching trajectories with semantic geographical information
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
A conceptual view on trajectories
Data & Knowledge Engineering
A clustering-based approach for discovering interesting places in trajectories
Proceedings of the 2008 ACM symposium on Applied computing
Computational Geometry: Theory and Applications
Detecting single file movement
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Robust Time-Referenced Segmentation of Moving Object Trajectories
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
Robust Time-Referenced Segmentation of Moving Object Trajectories
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
Towards a taxonomy of movement patterns
Information Visualization
An algorithmic framework for segmenting trajectories based on spatio-temporal criteria
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Finding long and similar parts of trajectories
Computational Geometry: Theory and Applications
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
| Hi-index | 0.00 |
We study one of the basic tasks in moving object analysis, namely the location of hotspots. A hotspot is a (small) region in which an entity spends a significant amount of time. Finding such regions is useful in many applications, for example in segmentation, clustering, and locating popular places. We may be interested in locating a minimum size hotspot in which the entity spends a fixed amount of time, or locating a fixed size hotspot maximizing the time that the entity spends inside it. Furthermore, we can consider the total time, or the longest contiguous time the entity spends in the hotspot. We solve all four versions of the problem. For a square hotspot, we can solve the contiguous-time versions in O(nlogn) time, where n is the number of trajectory vertices. The algorithms for the total-time versions are roughly quadratic. Finding a hotspot containing relatively the most time, compared to its size, takes O(n3) time. Even though we focus on a single moving entity, our algorithms immediately extend to multiple entities. Finally, we consider hotspots of different shape.