Computing the visibility polygon from a convex set and related problems
Journal of Algorithms
Query optimization in compressed database systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Approximate Query Processing Using Wavelets
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Fast Incremental Maintenance of Approximate Histograms
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Exploring artificial intelligence in the new millennium
Spatio-temporal data reduction with deterministic error bounds
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Indexing of network constrained moving objects
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
A Weight-based Map Matching Method in Moving Objects Databases
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Trajectory Compression under Network Constraints
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Usability analysis of compression algorithms for position data streams
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
On map matching of wireless positioning data: a selective look-ahead approach
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
NNCluster: an efficient clustering algorithm for road network trajectories
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Event processing and real-time monitoring over streaming traffic data
W2GIS'12 Proceedings of the 11th international conference on Web and Wireless Geographical Information Systems
Encoding network-constrained travel trajectories using routing algorithms
International Journal of Knowledge and Web Intelligence
Map-matched trajectory compression
Journal of Systems and Software
Effectively grouping trajectory streams
NFMCP'12 Proceedings of the First international conference on New Frontiers in Mining Complex Patterns
Semantic trajectories modeling and analysis
ACM Computing Surveys (CSUR)
Fast and exact network trajectory similarity computation: a case-study on bicycle corridor planning
Proceedings of the 2nd ACM SIGKDD International Workshop on Urban Computing
Dealing with trajectory streams by clustering and mathematical transforms
Journal of Intelligent Information Systems
| Hi-index | 0.00 |
The traditional way of representing motion in 3D space-time uses a trajectory, i.e. a sequence of (x,y,t) points. Such a trajectory may be produced by periodic sampling of a Global Positioning System (GPS) receiver. The are two problems with this representation of motion. First, imprecision due to errors (e.g. GPS receivers often produce off-the-road locations), and second, space complexity due to a large number of samplings. We examine an alternative representation, called a nonmaterialized trajectory, which addresses both problems by taking advantage of the a priori knowledge that the motion occurs on a transport network.