1 |
zoff99 |
51 |
ZANavi
|
2 |
|
|
======
|
3 |
|
|
|
4 |
|
|
ZANavi is a fork of NavIT. It is for the Android platfrom only!
|
5 |
|
|
for more details look at our wiki
|
6 |
|
|
|
7 |
|
|
http://zanavi.cc
|
8 |
|
|
|
9 |
|
|
CircleCI
|
10 |
|
|
========
|
11 |
|
|
|
12 |
|
|
[![Circle CI](https://circleci.com/gh/zoff99/zanavi/tree/master.svg?style=svg)](https://circleci.com/gh/zoff99/zanavi/tree/master)
|
13 |
|
|
|
14 |
|
|
|
15 |
|
|
tagsoup-1.2.1.jar:
|
16 |
|
|
==================
|
17 |
|
|
|
18 |
|
|
http://home.ccil.org/~cowan/tagsoup/
|
19 |
|
|
|
20 |
|
|
downloaded from: http://home.ccil.org/~cowan/tagsoup/tagsoup-1.2.1.jar
|
21 |
|
|
|
22 |
|
|
|
23 |
|
|
|
24 |
|
|
====================== original README below ==================
|
25 |
|
|
====================== original README below ==================
|
26 |
|
|
====================== original README below ==================
|
27 |
|
|
|
28 |
|
|
|
29 |
|
|
|
30 |
|
|
NavIT
|
31 |
|
|
=====
|
32 |
|
|
|
33 |
|
|
Navit is a open source (GPL) car navigation system with routing engine.
|
34 |
|
|
|
35 |
|
|
It's modular design is capable of using vector maps of various formats
|
36 |
|
|
for routing and rendering of the displayed map. It's even possible to
|
37 |
|
|
use multiple maps at a time.
|
38 |
|
|
|
39 |
|
|
The GTK+ or SDL user interfaces are designed to work well with touch
|
40 |
|
|
screen displays. Points of Interest of various formats are displayed
|
41 |
|
|
on the map.
|
42 |
|
|
|
43 |
|
|
The current vehicle position is either read from gpsd or directly from
|
44 |
|
|
NMEA GPS sensors.
|
45 |
|
|
|
46 |
|
|
The routing engine not only calculates an optimal route to your
|
47 |
|
|
destination, but also generates directions and even speaks to you.
|
48 |
|
|
|
49 |
|
|
Navit currently speaks 27 languages :
|
50 |
|
|
- Brazilian Portuguese
|
51 |
|
|
- Bulgarian
|
52 |
|
|
- Chinese (Hong Kong)
|
53 |
|
|
- Czech
|
54 |
|
|
- Danish
|
55 |
|
|
- Dutch
|
56 |
|
|
- English
|
57 |
|
|
- Estonian
|
58 |
|
|
- Finnish
|
59 |
|
|
- French
|
60 |
|
|
- German
|
61 |
|
|
- Hebrew
|
62 |
|
|
- Hungarian
|
63 |
|
|
- Italian
|
64 |
|
|
- Japanese
|
65 |
|
|
- Norwegian Bokmal
|
66 |
|
|
- Polish
|
67 |
|
|
- Portuguese
|
68 |
|
|
- Romanian
|
69 |
|
|
- Russian
|
70 |
|
|
- Slovak
|
71 |
|
|
- Slovenian
|
72 |
|
|
- Spanish
|
73 |
|
|
- Swedish
|
74 |
|
|
- Telugu
|
75 |
|
|
- Thai
|
76 |
|
|
- Turkish
|
77 |
|
|
|
78 |
|
|
You can help translating via our web based translation page :
|
79 |
|
|
http://translations.launchpad.net/navit/trunk/+pots/navit
|
80 |
|
|
|
81 |
|
|
|
82 |
|
|
For help or more information, please refer to the wiki :
|
83 |
|
|
http://wiki.navit-project.org
|
84 |
|
|
|
85 |
|
|
If you don't know where to start, we recommend you to read the
|
86 |
|
|
Interactive Help : http://wiki.navit-project.org/index.php/Interactive_help
|
87 |
|
|
|
88 |
|
|
|
89 |
|
|
Maps:
|
90 |
|
|
=====
|
91 |
|
|
|
92 |
|
|
The best navigation system is useless without maps. Those three maps
|
93 |
|
|
are known to work:
|
94 |
|
|
|
95 |
|
|
- OpenStreetMaps : display, routing, but street name search isn't complete
|
96 |
|
|
(see http://wiki.navit-project.org/index.php/OpenStreetMaps )
|
97 |
|
|
|
98 |
|
|
- Grosser Reiseplaner and compliant maps : full support
|
99 |
|
|
(see http://wiki.navit-project.org/index.php/European_maps )
|
100 |
|
|
|
101 |
|
|
- Garmin maps : display, routing, search is being worked on
|
102 |
|
|
(see http://wiki.navit-project.org/index.php/Garmin_maps )
|
103 |
|
|
|
104 |
|
|
|
105 |
|
|
GPS Support:
|
106 |
|
|
============
|
107 |
|
|
|
108 |
|
|
Navit read the current vehicle position :
|
109 |
|
|
- directly from a file
|
110 |
|
|
- from gpsd (local or remote)
|
111 |
|
|
- from udp server (friends tracking) (experimental)
|
112 |
|
|
|
113 |
|
|
|
114 |
|
|
Routing algorithm
|
115 |
|
|
=================
|
116 |
|
|
|
117 |
|
|
NavIt uses a Dijkstra algorithm for routing. The routing starts at the
|
118 |
|
|
destination by assigning a value to each point directly connected to
|
119 |
|
|
destination point. The value represents the estimated time needed to
|
120 |
|
|
pass this distance.
|
121 |
|
|
|
122 |
|
|
Now the point with the lowest value is choosen using the Fibonacci
|
123 |
|
|
heap and a value is assigned to connected points whos are
|
124 |
|
|
unevaluated or whos current value ist greater than the new one.
|
125 |
|
|
|
126 |
|
|
The search is repeated until the origin is found.
|
127 |
|
|
|
128 |
|
|
Once the origin is reached, all that needs to be done is to follow the
|
129 |
|
|
points with the lowest values to the destination.
|
130 |
|
|
|
131 |
|
|
|