Graphics gems IV
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Spatial Databases-Accomplishments and Research Needs
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the Ninth International Conference on Data Engineering
High-performance spatial indexing for location-based services
WWW '03 Proceedings of the 12th international conference on World Wide Web
Indexing the Trajectories of Moving Objects in Networks*
Geoinformatica
Spatial indexing in microsoft SQL server 2008
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Geodetic point-in-polygon query processing in oracle spatial
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Hi-index | 0.00 |
The ACM SIGSPATIAL Cup 2013 is about geo-fencing, a problem of determining whether sampled location points fall inside or within a certain distance from virtual perimeters for real-world geographic areas. This paper describes one of the winning submissions of the competition. The approach applies two novel techniques, namely Trajectory Partitioning (TP) and Boundary Simplification (BS). TP partitions the movement trajectory of an object into segments and processes the points within the same segment simultaneously. BS simplifies the polygons thus accelerates the geo-fencing process.