Re: [Potlatch-dev] [OpenStreetMap] #4310: Some keyboard shortcuts inaccessible (or wrong) on non-english keyboard layouts
#4310: Some keyboard shortcuts inaccessible (or wrong) on non-english keyboard layouts ---+ Reporter: rasher | Owner: potlatch-dev@… Type: defect | Status: new Priority: minor | Milestone: Component: potlatch2 | Version: Keywords: | ---+ Comment(by Richard): If we look at KeyboardEvent.charCode as well as KeyboardEvent.keyCode that should fix it. -- Ticket URL: https://trac.openstreetmap.org/ticket/4310#comment:1 OpenStreetMap http://www.openstreetmap.org/ OpenStreetMap is a free editable map of the whole world ___ Potlatch-dev mailing list Potlatch-dev@openstreetmap.org http://lists.openstreetmap.org/listinfo/potlatch-dev
Re: [Potlatch-dev] [OpenStreetMap] #3596: copy relation membership
#3596: copy relation membership --+- Reporter: Mueck| Owner: potlatch-dev@… Type: enhancement | Status: closed Priority: major| Milestone: Component: potlatch2| Version: Resolution: fixed|Keywords: --+- Comment(by stevage): (Hmm, reading more closely, what I implemented isn't exactly what was asked for, but is hopefully still useful.) -- Ticket URL: https://trac.openstreetmap.org/ticket/3596#comment:2 OpenStreetMap http://www.openstreetmap.org/ OpenStreetMap is a free editable map of the whole world ___ Potlatch-dev mailing list Potlatch-dev@openstreetmap.org http://lists.openstreetmap.org/listinfo/potlatch-dev
Re: [Potlatch-dev] [OpenStreetMap] #4311: Allowing multi-selection on the basis of common tags
#4311: Allowing multi-selection on the basis of common tags --+- Reporter: Richard Mann | Owner: potlatch-dev@… Type: enhancement | Status: new Priority: minor | Milestone: Component: potlatch2 | Version: Keywords:| --+- Comment(by stevage): By contiguity not being necessary, you mean you'd select all ways with the same name (or ref/...) even if they weren't contigous? That would get a lot of false positives... I don't think the recursion would be particularly hard (or scary) to write - even fun, maybe. Ok, if we need to support other tags like ref (which I agree with), then what could the interface look like? A dropdown box next to the Key field feels too intrusive (imho) for a pretty niche feature. Maybe a button on the same row as Delete and Add, Find related? Hold down Ctrl and click a tag? Btw can you spell out your AND requirement? You want to be able to specify multiple tags, and select all ways that match all of them? Is this important? Is one tag not enough? What's the use case? -- Ticket URL: https://trac.openstreetmap.org/ticket/4311#comment:4 OpenStreetMap http://www.openstreetmap.org/ OpenStreetMap is a free editable map of the whole world ___ Potlatch-dev mailing list Potlatch-dev@openstreetmap.org http://lists.openstreetmap.org/listinfo/potlatch-dev
Re: [OSM-dev] [Geowanking] shortestpathtree.org - a tool for quickly checking OSM data integrity
Interesting, is there a way to take into account a resistance value for each segment? bobb Brandon Martin-Anderson badh...@gmail.com wrote: Behold! I made a thing. http://shortestpathtree.org It creates shortest path trees, which are pretty, and have a variety of uses. My favorite use is quickly and phenomenologically checking OSM referential integrity across entire cities. Also, potentially, it can tell you how to get places. Tell me how you like it. Colophon, for the interested: Server and client-side code is at https://github.com/bmander/vtp. I took Migurski's city extracts in PBF format and popped them into a Mongodb instance using a homebrew script in node.js. Then I applied a series of map-reduce runs to slice the ways at shared intersections, and to collect them into tiles. This is slow, but there's some home of parallelization. A simple node.js script serves the vector tiles to the client, where all routing is done; printed to a homebrew canvas-based client. The disadvantage is that routing is slow for you. The advantage is the server doesn't have to do anything except hand out tiles, which, ideally, should be pretty small. -B ___ Geowanking mailing list geowank...@geowanking.org http://geowanking.org/mailman/listinfo/geowanking_geowanking.org ___ dev mailing list dev@openstreetmap.org http://lists.openstreetmap.org/listinfo/dev
Re: [OSM-dev] [Geowanking] shortestpathtree.org - a tool for quickly checking OSM data integrity
Very very cool. Especially the tiled vectors! Regards, Peter Rushforth -Original Message- From: geowanking-boun...@geowanking.org [mailto:geowanking-boun...@geowanking.org] On Behalf Of Brandon Martin-Anderson Sent: March 12, 2012 12:12 To: osm-dev; geowank...@geowanking.org Subject: [Geowanking] shortestpathtree.org - a tool for quickly checking OSM data integrity Behold! I made a thing. http://shortestpathtree.org It creates shortest path trees, which are pretty, and have a variety of uses. My favorite use is quickly and phenomenologically checking OSM referential integrity across entire cities. Also, potentially, it can tell you how to get places. Tell me how you like it. Colophon, for the interested: Server and client-side code is at https://github.com/bmander/vtp. I took Migurski's city extracts in PBF format and popped them into a Mongodb instance using a homebrew script in node.js. Then I applied a series of map-reduce runs to slice the ways at shared intersections, and to collect them into tiles. This is slow, but there's some home of parallelization. A simple node.js script serves the vector tiles to the client, where all routing is done; printed to a homebrew canvas-based client. The disadvantage is that routing is slow for you. The advantage is the server doesn't have to do anything except hand out tiles, which, ideally, should be pretty small. -B ___ Geowanking mailing list geowank...@geowanking.org http://geowanking.org/mailman/listinfo/geowanking_geowanking.org ___ dev mailing list dev@openstreetmap.org http://lists.openstreetmap.org/listinfo/dev
[OSM-dev] Interested in working for 'Less Wiggly Routes'.
Hi, I am a second year student of Netaji Subhas Institue of Technology(under Delhi University),India.My major is Instrumentation and Control engineering.I am good in Data Structures and Algorithms,as for the current project.Besides this I am good in Linux,CSS etc.. I am programming for the past five years and have experience in C/C+ +.In my day to day life I spend a lot of time in cracking computing puzzles and won various awards in my college. Idea for the GSOC: I liked Less Wiggly Routes ,and am interested in implementing the same.I first saw this idea on project ideas page. I think it is my project and am willing to learn more if guided on how to proceed further for this project. thanks Raman Gupta ___ dev mailing list dev@openstreetmap.org http://lists.openstreetmap.org/listinfo/dev
Re: [OSM-dev] [Geowanking] shortestpathtree.org - a tool for quickly checking OSM data integrity
Awesome work - for the shortest path calculation are you using an A*, Bellman-Ford type approach, or something else? We tried a bunch of optimizations to a Floyd style all-to-all SP problem back in the day. Tricky computations and always cool to see new approaches. Not to mention a brilliant visualization of it all. thanks, sean On Mon, Mar 12, 2012 at 12:49 PM, Brandon Martin-Anderson badh...@gmail.com wrote: Not directly. Stochastic optimizing processes, or optimizing processes over stochastic data sets, tend to end up looking biological, because biological systems are stochastic optimizing processes. -B On Mon, Mar 12, 2012 at 12:42 PM, Laurence Penney l...@lorp.org wrote: Utterly beautiful. Is it inspired by Günther von Hagens’s work with blood vessels? http://weheartit.com/entry/19937599 http://plastynarium.pl/images/2011/10/krwiobieg.jpg http://3.bp.blogspot.com/_DaOtlZ8Ux7s/TFmhpAJziMI/ADE/PFP15vpUZlU/s1600/bodies-revealed-blood-vessels.jpg http://www.bodyworlds.com/en/media/picture_database/preview.html?id=4 http://thedispersalofdarwin.files.wordpress.com/2011/11/img_0690.jpg - Laurence On 12 Mar 2012, at 16:11, Brandon Martin-Anderson wrote: Behold! I made a thing. http://shortestpathtree.org It creates shortest path trees, which are pretty, and have a variety of uses. My favorite use is quickly and phenomenologically checking OSM referential integrity across entire cities. Also, potentially, it can tell you how to get places. Tell me how you like it. Colophon, for the interested: Server and client-side code is at https://github.com/bmander/vtp. I took Migurski's city extracts in PBF format and popped them into a Mongodb instance using a homebrew script in node.js. Then I applied a series of map-reduce runs to slice the ways at shared intersections, and to collect them into tiles. This is slow, but there's some home of parallelization. A simple node.js script serves the vector tiles to the client, where all routing is done; printed to a homebrew canvas-based client. The disadvantage is that routing is slow for you. The advantage is the server doesn't have to do anything except hand out tiles, which, ideally, should be pretty small. -B ___ dev mailing list dev@openstreetmap.org http://lists.openstreetmap.org/listinfo/dev ___ Geowanking mailing list geowank...@geowanking.org http://geowanking.org/mailman/listinfo/geowanking_geowanking.org -- Sean Gorman PhD. GeoIQ 2200 Wilson Blvd. Suite 307 Arlington VA, 22201 mobile: 202-321-3914 office: 703-647-2151 -- This email and the information it contains are confidential and may be privileged. If you have received this email in error please notify me immediately. You should not copy it for any purpose, or disclose its contents to any other person. Internet communications are not secure and, therefore, FortiusOne does not accept legal responsibility for the contents of this message as it has been transmitted over a public network. If you suspect the message may have been intercepted or amended please contact the sender. ___ dev mailing list dev@openstreetmap.org http://lists.openstreetmap.org/listinfo/dev
Re: [OSM-dev] [Geowanking] shortestpathtree.org - a tool for quickly checking OSM data integrity
Cool you might get a bit better performance here: https://github.com/bgrins/javascript-astar Purely supposition on my part have not tested it cheers, sean On Mon, Mar 12, 2012 at 1:05 PM, Brandon Martin-Anderson badh...@gmail.comwrote: About thirty lines of javascript implementing a pretty brain-dead breadth-first search: https://github.com/bmander/vtp/blob/master/templates/game.html#L118 -B On Mon, Mar 12, 2012 at 1:01 PM, Sean Gorman s...@geoiq.com wrote: Awesome work - for the shortest path calculation are you using an A*, Bellman-Ford type approach, or something else? We tried a bunch of optimizations to a Floyd style all-to-all SP problem back in the day. Tricky computations and always cool to see new approaches. Not to mention a brilliant visualization of it all. thanks, sean On Mon, Mar 12, 2012 at 12:49 PM, Brandon Martin-Anderson badh...@gmail.com wrote: Not directly. Stochastic optimizing processes, or optimizing processes over stochastic data sets, tend to end up looking biological, because biological systems are stochastic optimizing processes. -B On Mon, Mar 12, 2012 at 12:42 PM, Laurence Penney l...@lorp.org wrote: Utterly beautiful. Is it inspired by Günther von Hagens’s work with blood vessels? http://weheartit.com/entry/19937599 http://plastynarium.pl/images/2011/10/krwiobieg.jpg http://3.bp.blogspot.com/_DaOtlZ8Ux7s/TFmhpAJziMI/ADE/PFP15vpUZlU/s1600/bodies-revealed-blood-vessels.jpg http://www.bodyworlds.com/en/media/picture_database/preview.html?id=4 http://thedispersalofdarwin.files.wordpress.com/2011/11/img_0690.jpg - Laurence On 12 Mar 2012, at 16:11, Brandon Martin-Anderson wrote: Behold! I made a thing. http://shortestpathtree.org It creates shortest path trees, which are pretty, and have a variety of uses. My favorite use is quickly and phenomenologically checking OSM referential integrity across entire cities. Also, potentially, it can tell you how to get places. Tell me how you like it. Colophon, for the interested: Server and client-side code is at https://github.com/bmander/vtp. I took Migurski's city extracts in PBF format and popped them into a Mongodb instance using a homebrew script in node.js. Then I applied a series of map-reduce runs to slice the ways at shared intersections, and to collect them into tiles. This is slow, but there's some home of parallelization. A simple node.js script serves the vector tiles to the client, where all routing is done; printed to a homebrew canvas-based client. The disadvantage is that routing is slow for you. The advantage is the server doesn't have to do anything except hand out tiles, which, ideally, should be pretty small. -B ___ dev mailing list dev@openstreetmap.org http://lists.openstreetmap.org/listinfo/dev ___ Geowanking mailing list geowank...@geowanking.org http://geowanking.org/mailman/listinfo/geowanking_geowanking.org -- Sean Gorman PhD. GeoIQ 2200 Wilson Blvd. Suite 307 Arlington VA, 22201 mobile: 202-321-3914 office: 703-647-2151 -- This email and the information it contains are confidential and may be privileged. If you have received this email in error please notify me immediately. You should not copy it for any purpose, or disclose its contents to any other person. Internet communications are not secure and, therefore, FortiusOne does not accept legal responsibility for the contents of this message as it has been transmitted over a public network. If you suspect the message may have been intercepted or amended please contact the sender. -- Sean Gorman PhD. GeoIQ 2200 Wilson Blvd. Suite 307 Arlington VA, 22201 mobile: 202-321-3914 office: 703-647-2151 -- This email and the information it contains are confidential and may be privileged. If you have received this email in error please notify me immediately. You should not copy it for any purpose, or disclose its contents to any other person. Internet communications are not secure and, therefore, FortiusOne does not accept legal responsibility for the contents of this message as it has been transmitted over a public network. If you suspect the message may have been intercepted or amended please contact the sender. ___ dev mailing list dev@openstreetmap.org http://lists.openstreetmap.org/listinfo/dev
Re: [OSM-dev] Problems with mod_tile + tirex
Valery, [Thu Mar 22 20:59:25 2012] [info] [client 87.252.227.84] tile_storage_hook: handler(tile_serve), uri(/tiles/mapnik/1/0/1.png), filename(/var/lib/mod_tile/mapnik/1/0/0/0/0/0.meta), path_info((null)), referer: http://mapserv.test.maps.local/ [Thu Mar 22 20:59:25 2012] [info] [client 87.252.227.84] Requesting style(mapnik) z(1) x(0) y(1) from renderer with priority 5, referer: http://mapserv.test.maps.local/ Have you got a symbolic link from /var/lib/mod_tile /var/lib/tirex/tiles? If not, create it and re-try. Bye Frederik -- Frederik Ramm ## eMail frede...@remote.org ## N49°00'09 E008°23'33 ___ dev mailing list dev@openstreetmap.org http://lists.openstreetmap.org/listinfo/dev
Re: [OSM-dev] Problems with mod_tile + tirex
Valery N. wrote For some unknown reasons request like http://mapserv.test.maps.local/tiles/mapnik/1/1/-1.png raise* 404 error* on web server Well, that is not a valid request. A negative y coordinate is not allowed and so it will correctly give a 404 error. Also the rest of you mod_tile log seems fine and gives the expected result. It will correctly mention no valid tile layer for request uri's like /favicon.ico or /index.html, and fall through to normal serving of those files. Have you tried waiting for a while and then reloading the tile. At low zoom levels, rendering tiles can take several minutes and mod_tile will time out before it is finished rendering. The next time it will then hopefully get the rendered tile from cache. Kai -- View this message in context: http://gis.19327.n5.nabble.com/Problems-with-mod-tile-tirex-tp5587540p5588086.html Sent from the Developer Discussion mailing list archive at Nabble.com. ___ dev mailing list dev@openstreetmap.org http://lists.openstreetmap.org/listinfo/dev
[OSM-dev] GSoC - Improvements to Vespucci
Hi, I am considering to apply for a GSoC project to improve the Android OSM editor Vespucci. I am looking to achieve two things: 1. An easier editing mode for new users. (This would include Issue 100 in the issue tracker, http://code.google.com/p/osmeditor4android/issues/detail?id=100) 2. Layer/custom map support to allow users to create their own OSM-based maps with non-public points of interest My proposal for (1) would be to add another editing mode (in addition to the move, new etc. modes currently present). A long-press on any position would create a node, and call up a customizable menu to select the type of the node. The menu would be optionally structured in folders, and could contain both node-type POIs and ways. An example workflow could look like this: a) User long-presses to mark a location b) Menu comes up: | Roads| | POI | c) User selects Roads, a new Menu comes up | Highway | | Road | | Footpath | d) User selects a type, say, footpath, and since this is a way/polyline type item, he is allowed to place more nodes. He finishes node placement using an on-screen button. The app creates a way, automatically tagging it with one or more tags associated with that menu item (e.g. highway=path). By selecting and editing the path (double-click/tap maybe?), the user gets the last menu again and can change the type. The menu structure would be defined as an XML file and could be custom to the currently active layer/overlay. Which brings me to the second part of my proposal: I was unable to find any good editor that would allow easy to use, collaborative editing of custom map overlays. Such an editor could be very useful in a number of situations. In emergency situations, such a map overlay could be used to share information about areas covered by searches, or casualties found. In planning, this could be used to draw plans of an area etc. Vespucci would be an ideal base for this: It already has the necessary editing functionality, the upload API functions, and the display of the background map from various sources. Thus, the second part of my proposal would be adding an option to select which map to edit (i.e. which API to use). Instead of editing the real OSM data, users could edit their custom map, hosted on their custom OSM-style server, using OSM (or Bing) tiles as the background. Each custom map would have its own item menu associated - e.g. an emergency worker on the local SAR overview map would be offered to add casualty and search area markers instead of roads and POIs. Integrating this into Vespucci would allow the new editor use the large amount of existing features, and make sure that Vespucci profits from any improvements. I was considering to create such an editor for quite some time. The existing code in Vespucci gives me the means to do it in a reasonable timeframe, and GSoC would give me the motivation and pressure to actually do it. Do you think these ideas would make a good base for a GSoC project proposal, and would you be interested in having them implemented? Of course, any feedback and suggestions are more than welcome. Also, is there any interest in using offline background tiles rendered on the device using the mapsforge-maps library and their compressed format? I hacked together a quick PoC yesterday, and it doesn't seem too hard. Kind regards, Jan ___ dev mailing list dev@openstreetmap.org http://lists.openstreetmap.org/listinfo/dev
