4 Navit is a open source (GPL) car navigation system with routing engine.
6 It's modular design is capable of using vector maps of various formats
7 for routing and rendering of the displayed map. It's even possible to
8 use multiple maps at a time.
10 The GTK+ or SDL user interfaces are designed to work well with touch
11 screen displays. Points of Interest of various formats are displayed
14 The current vehicle position is either read from gpsd or directly from
17 The routing engine not only calculates an optimal route to your
18 destination, but also generates directions and even speaks to you.
20 Navit currently speaks 20 languages :
21 - Brazilian Portuguese
42 You can help translating via our web based translation page :
43 http://translations.launchpad.net/navit/trunk/+pots/navit
46 For help or more information, please refer to the wiki :
47 http://wiki.navit-project.org
49 If you don't know where to start, we recommend you to read the
50 Interactive Help : http://wiki.navit-project.org/index.php/Interactive_help
56 The best navigation system is useless without maps. Those three maps
59 - OpenStreetMaps : display, routing, but street name search isn't complete
60 (see http://wiki.navit-project.org/index.php/OpenStreetMaps )
62 - Grosser Reiseplaner and compliant maps : full support
63 (see http://wiki.navit-project.org/index.php/European_maps )
65 - Garmin maps : display, routing, search is being worked on
66 (see http://wiki.navit-project.org/index.php/Garmin_maps )
72 Navit read the current vehicle position :
73 - directly from a file
74 - from gpsd (local or remote)
75 - from udp server (friends tracking) (experimental)
81 NavIt uses a Dijkstra algorithm for routing. The routing starts at the
82 destination by assigning a value to each point directly connected to
83 destination point. The value represents the estimated time needed to
86 Now the point with the lowest value is choosen using the Fibonacci
87 heap and a value is assigned to connected points whos are
88 unevaluated or whos current value ist greater than the new one.
90 The search is repeated until the origin is found.
92 Once the origin is reached, all that needs to be done is to follow the
93 points with the lowest values to the destination.