If somebody knows how the current quad tile implementation is supposed
to work, please let me know.
I've had a quick look at the error but I don't know how the quad tile
algorithm should work. When I implemented this I just copied the C
implementation, however I found it a little confusing
Hi Brett,
On 27 Apr 2008, at 11:38, Brett Henderson wrote:
If somebody knows how the current quad tile implementation is supposed
to work, please let me know.
I've had a quick look at the error but I don't know how the quad tile
algorithm should work. When I implemented this I just copied
On Sun, Apr 27, 2008 at 1:34 PM, Tom Hughes [EMAIL PROTECTED] wrote:
x = (int) Math.floor((longitude + 180) * 65536 / 360);
y = (int) Math.floor((latitude + 90) * 65536 / 180);
Yep - the input (after adjusting to zero) is between 0 and 360 (for
the longitude) or 0 and
In message [EMAIL PROTECTED]
Martijn van Oosterhout [EMAIL PROTECTED] wrote:
On Sun, Apr 27, 2008 at 1:34 PM, Tom Hughes [EMAIL PROTECTED] wrote:
x = (int) Math.floor((longitude + 180) * 65536 / 360);
y = (int) Math.floor((latitude + 90) * 65536 / 180);
Yep
Hello all
I'm proud to announce the first release of osmtools, a fast embedded
osm-data-database. This is an alpha version, only to show whats
possible and to check where development should go. But it already
features a fcgi server which might be somewhat usable for the export
tab.
From the
Hi,
I'm proud to announce the first release of osmtools, a fast embedded
osm-data-database.
[...]
Instead ways directly consist of a
number of points. This should speed up for example rendering to svg or
routing by a huge amount.
For routing, it is important to know whether two ways meet
Ok perhaps I should provide a link :)
http://minimi.dyndns.org/osmtools.tar.bz2
2008/4/27 Hendrik Siedelmann [EMAIL PROTECTED]:
Hello all
I'm proud to announce the first release of osmtools, a fast embedded
osm-data-database. This is an alpha version, only to show whats
possible and to
2008/4/27 Frederik Ramm [EMAIL PROTECTED]:
Instead ways directly consist of a
number of points. This should speed up for example rendering to svg or
routing by a huge amount.
For routing, it is important to know whether two ways meet at a
junction or whether they just pass over or
Perhaps I should have mentioned that only nodes without tags are
completely ignored in the database. Nodes that contain tags will
remain in the database.
Also a point is saved as two 32bit unsigned integer, which means a id
takes as much space as a point. And two 32bit numbers can also be
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hendrik Siedelmann schrieb:
| Nodes can still be identified by their lat/lon coordinates. As nodes
| are not duplicated in the database this is possible. And routing still
| needs to find which ways reference a node, so routing from one way to
|
2008/4/27 Marcus Wolschon [EMAIL PROTECTED]:
| Nodes can still be identified by their lat/lon coordinates. As nodes
| are not duplicated in the database this is possible. And routing still
| needs to find which ways reference a node, so routing from one way to
| another is still
Hello,
We are trying to develop a location based mobile phone application by
customizing the functionality of GpsMid. Does someone know how to find the
current position of the user in GpsMid.
Second,while customizing the application where can we start from either
gpsmid src code or osm2gpsmid.
On Sun, Apr 27, 2008 at 4:58 PM, Hendrik Siedelmann
[EMAIL PROTECTED] wrote:
2008/4/27 Marcus Wolschon [EMAIL PROTECTED]:
| Nodes can still be identified by their lat/lon coordinates. As nodes
| are not duplicated in the database this is possible. And routing still
| needs to find
Hello,
Ansari Ghouse wrote:
Hello,
We are trying to develop a location based mobile phone application by
customizing the functionality of GpsMid. Does someone know how to find
the current position of the user in GpsMid.
I am not sure I follow what you mean here. Where do you want to find
2008/4/27 Andy Allan [EMAIL PROTECTED]:
On Sun, Apr 27, 2008 at 4:58 PM, Hendrik Siedelmann
[EMAIL PROTECTED] wrote:
2008/4/27 Marcus Wolschon [EMAIL PROTECTED]:
| Nodes can still be identified by their lat/lon coordinates. As nodes
| are not duplicated in the database
On Sun, Apr 27, 2008 at 7:47 PM, Hendrik Siedelmann
[EMAIL PROTECTED] wrote:
A question: So when doing routing two ways can be considered connected
when they share a node.
Yes.
And restricitons in this connection (turn
restrictions ...) are embedded in the node they both reference,
Andy Allan wrote:
On Sun, Apr 27, 2008 at 4:58 PM, Hendrik Siedelmann
[EMAIL PROTECTED] wrote:
2008/4/27 Marcus Wolschon [EMAIL PROTECTED]:
| Nodes can still be identified by their lat/lon coordinates. As nodes
| are not duplicated in the database this is possible. And
Hi,
A question: So when doing routing two ways can be considered connected
when they share a node. And restricitons in this connection (turn
restrictions ...) are embedded in the node they both reference,
correct?
No, turn restrictions are supposed to be modelled through the use of
clearing mine, should free 4 gig
I found a planet file from November 2006 in there (!)
On 23 Apr 2008, at 10:06, Sebastian Spaeth wrote:
Our /home partition on dev is 83% full and I suspect many unneeded
data
linger there.
Here is our /home offender list in kb. Please see if you can
For any work on the main web site, just create a branch in the
rails_port_branches directory - there are several there already.
This should work well. And it's always better not to work on the main
trunk initially.
But Mikel, in this case, its' best that i leave it to you to decide
On Wed, 2008-04-23 at 11:06 +0200, Sebastian Spaeth wrote:
Here is our /home offender list in kb. Please see if you can delete
stuff there. I will take the liberty to remove stuff that hasn't been
touched from more than a year and whose owner don't tell me to leave
there stuff alone.
21 matches
Mail list logo
