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