Journal of Algorithms
Exact algorithms for partial curve matching via the Fréchet distance
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
From GPS traces to a routable road map
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Road network reconstruction for organizing paths
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Metric graph reconstruction from noisy data
Proceedings of the twenty-seventh annual symposium on Computational geometry
Incremental clustering for trajectories
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
On vehicle tracking data-based road network generation
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Probabilistic street-intersection reconstruction from GPS trajectories: approaches and challenges
Proceedings of the Third ACM SIGSPATIAL International Workshop on Querying and Mining Uncertain Spatio-Temporal Data
Segmentation-based road network construction
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
We consider the problem of constructing street networks from geo-referenced trajectory data: Given a set of trajectories in the plane, compute a street network that represents all trajectories in the set. We present a simple and practical incremental algorithm that is based on partial matching of the trajectories to the graph. We use minimumlink paths to reduce the complexity of the reconstructed graph. We provide quality guarantees and experimental results based on both real and synthetic data. For the partial matching we introduce a new variant of partial Fréchet distance.