Skip to content

Matches a sequence of GPS coordinates to road graph

License

Notifications You must be signed in to change notification settings

mtrevisan/MapMatcher

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

MapMatcher (trivial name, I know)

Java-17+ License: GPL v3

Project Status: Active – The project has reached a stable, usable state and is being actively developed.


Forewords

This is, as the name suggests, yet another map matcher (see this page) between a series of observations (mainly noisy GPS points) and the most probable path on a given graph.
It uses a first–order Hidden Markov Model, Viterbi algorithm, A* search algorithm, Ramer–Douglas–Peuker algorithm for point simplification, Bentley–Ottmann algorithm for intersection between points and polylines, Graham scan for convex hull calculation, Kalman filter for smoothing the observations, HPR tree to get the list of roads, various geodetics algorithms, and a graph merger builder that connects also near edges.


This project adheres to the Zero Bugs Commitment.


Table of Contents

  1. Contributing
  2. Changelog
    1. version 0.0.0
  3. License

Contributing

Please report issues to the issue tracker if you have any difficulties using this module, found a bug, or request a new feature.

Pull requests are welcomed.


Changelog

version 0.0.0 - 20221202

  • First version.

License

This project is licensed under MIT license. For the full text of the license, see the LICENSE file.