outlinefromtracks Wiki Rss Feedhttps://outlinefromtracks.codeplex.com/outlinefromtracks Wiki Rss DescriptionUpdated Wiki: Homehttps://outlinefromtracks.codeplex.com/wikipage?version=8<div class="wikidoc">Library for calculating outline from a set of dissolved (GPS) tracks. <br /><br /><b>WARNING</b>: Library has an issue with breaking paths at intersection. Here is the <a href="https://outlinefromtracks.codeplex.com/wikipage?title=solution&referringTitle=Home">solution</a>.<br /><br />Library for calculating outline from a set of (GPS) tracks is provided. Tracks should be dissolved (i.e. split at intersection points). The advantage in comparison to *hull algorithms is that current solution uses the already existing outline curve information. The main idea behind algorithm is to pick correct curves that lay on the outline. This is performed by picking the initial track and adding to the path curves that have the smallest angle between the path end vector and candidate curve. This way outline is collected from available curves in clockwise direction.<br /><br />Library is able to deal with multiple disconnected areas in which case speed decreases several times because of the need to mark inner curves. This could be fixed by implementing initial curve diffusion that would build a neighboring curve graph. This would increase speed both of the outline calculation and used curve marking.<br /><br />Sample app provided for anyone to draw intersectable curves and test algorithm.<br /><br />Initial problem was formulated here <a href="http://gis.stackexchange.com/questions/102559/outline-from-multiple-tracks">http://gis.stackexchange.com/questions/102559/outline-from-multiple-tracks</a></div><div class="ClearBoth"></div>aleksaspielikisThu, 09 Oct 2014 10:56:20 GMTUpdated Wiki: Home 20141009105620AUpdated Wiki: Homehttps://outlinefromtracks.codeplex.com/wikipage?version=7<div class="wikidoc">Library for calculating outline from a set of dissolved (GPS) tracks. <br /><br /><b>WARNING</b>: Library has an issue with breaking paths at intersection <a href="https://outlinefromtracks.codeplex.com/wikipage?title=solution&referringTitle=Home">solution</a>.<br /><br />Library for calculating outline from a set of (GPS) tracks is provided. Tracks should be dissolved (i.e. split at intersection points). The advantage in comparison to *hull algorithms is that current solution uses the already existing outline curve information. The main idea behind algorithm is to pick correct curves that lay on the outline. This is performed by picking the initial track and adding to the path curves that have the smallest angle between the path end vector and candidate curve. This way outline is collected from available curves in clockwise direction.<br /><br />Library is able to deal with multiple disconnected areas in which case speed decreases several times because of the need to mark inner curves. This could be fixed by implementing initial curve diffusion that would build a neighboring curve graph. This would increase speed both of the outline calculation and used curve marking.<br /><br />Sample app provided for anyone to draw intersectable curves and test algorithm.<br /><br />Initial problem was formulated here <a href="http://gis.stackexchange.com/questions/102559/outline-from-multiple-tracks">http://gis.stackexchange.com/questions/102559/outline-from-multiple-tracks</a></div><div class="ClearBoth"></div>aleksaspielikisTue, 07 Oct 2014 14:51:25 GMTUpdated Wiki: Home 20141007025125PUpdated Wiki: solutionhttps://outlinefromtracks.codeplex.com/wikipage?title=solution&version=1<div class="wikidoc">Library has an issue with breaking paths at intersection points. Function is called Dissolve.<br /><br />In my case I use this lab for .gpx files. And to get around this issue I use GDAL ogr2ogr operation. The command call looks like this:<br /><br />ogr2ogr -nlt MULTILINESTRING -dsco GPX<i>USE</i>EXTENSIONS=YES -lco FORCE<i>GPX</i>TRACK=YES -f GPX "%output%" "%input%" -dialect sqlite -sql "select ST_union(Geometry) from tracks"<br /><br />Here %input% is an input gpx file and %output% - output gpx file.<br /><br />After performing this operation outline calculation works like a charm.</div><div class="ClearBoth"></div>aleksaspielikisTue, 07 Oct 2014 14:50:31 GMTUpdated Wiki: solution 20141007025031PUpdated Wiki: Homehttps://outlinefromtracks.codeplex.com/wikipage?version=6<div class="wikidoc">Library for calculating outline from a set of dissolved (GPS) tracks. <br /><br />WARNING: Library has an issue with breaking paths at intersection <a href="https://outlinefromtracks.codeplex.com/wikipage?title=solution&referringTitle=Home">solution</a>.<br /><br />Library for calculating outline from a set of (GPS) tracks is provided. Tracks should be dissolved (i.e. split at intersection points). The advantage in comparison to *hull algorithms is that current solution uses the already existing outline curve information. The main idea behind algorithm is to pick correct curves that lay on the outline. This is performed by picking the initial track and adding to the path curves that have the smallest angle between the path end vector and candidate curve. This way outline is collected from available curves in clockwise direction.<br /><br />Library is able to deal with multiple disconnected areas in which case speed decreases several times because of the need to mark inner curves. This could be fixed by implementing initial curve diffusion that would build a neighboring curve graph. This would increase speed both of the outline calculation and used curve marking.<br /><br />Sample app provided for anyone to draw intersectable curves and test algorithm.<br /><br />Initial problem was formulated here <a href="http://gis.stackexchange.com/questions/102559/outline-from-multiple-tracks">http://gis.stackexchange.com/questions/102559/outline-from-multiple-tracks</a></div><div class="ClearBoth"></div>aleksaspielikisTue, 07 Oct 2014 14:46:41 GMTUpdated Wiki: Home 20141007024641PUpdated Wiki: Homehttps://outlinefromtracks.codeplex.com/wikipage?version=5<div class="wikidoc">Library for calculating outline from a set of dissolved (GPS) tracks. <br /><br />Library for calculating outline from a set of (GPS) tracks is provided. Tracks should be dissolved (i.e. split at intersection points). The advantage in comparison to *hull algorithms is that current solution uses the already existing outline curve information. The main idea behind algorithm is to pick correct curves that lay on the outline. This is performed by picking the initial track and adding to the path curves that have the smallest angle between the path end vector and candidate curve. This way outline is collected from available curves in clockwise direction.<br /><br />Library is able to deal with multiple disconnected areas in which case speed decreases several times because of the need to mark inner curves. This could be fixed by implementing initial curve diffusion that would build a neighboring curve graph. This would increase speed both of the outline calculation and used curve marking.<br /><br />Sample app provided for anyone to draw intersectable curves and test algorithm.<br /><br />Initial problem was formulated here <a href="http://gis.stackexchange.com/questions/102559/outline-from-multiple-tracks">http://gis.stackexchange.com/questions/102559/outline-from-multiple-tracks</a></div><div class="ClearBoth"></div>aleksaspielikisThu, 10 Jul 2014 21:32:19 GMTUpdated Wiki: Home 20140710093219PUpdated Wiki: Homehttps://outlinefromtracks.codeplex.com/wikipage?version=4<div class="wikidoc">Library for calculating outline from a set of dissolved (GPS) tracks. <br /><br />Library for calculating outline from a set of (GPS) tracks is provided. Tracks should be dissolved (i.e. split at intersection points). The advantage in comparison to *hull algorithms is that current solution uses the already existing outline curve information. The main idea behind algorithm is to pick correct curves that lay on the outline. This is performed by picking the initial track and adding to the path curves that have the smallest angle between the path end vector and candidate curve. This way outline is collected from available curves in clockwise direction.<br /><br />Library is able to deal with multiple disconnected areas in which case speed decreases several times because of the need to mark inner curves. This could be fixed by implementing initial curve diffusion that would build a neighboring curve graph. This would increase speed both of the outline calculation and used curve marking.<br /><br />Initial problem was formulated here <a href="http://gis.stackexchange.com/questions/102559/outline-from-multiple-tracks">http://gis.stackexchange.com/questions/102559/outline-from-multiple-tracks</a></div><div class="ClearBoth"></div>aleksaspielikisTue, 08 Jul 2014 15:36:23 GMTUpdated Wiki: Home 20140708033623PUpdated Wiki: Homehttps://outlinefromtracks.codeplex.com/wikipage?version=3<div class="wikidoc">Library for calculating outline from a set of dissolved (GPS) tracks. <br /><br />Library for calculating outline from a set of (GPS) tracks is provided. Tracks should be dissolved (i.e. split at intersection points). The advantage in comparison to *hull algorithms is that current solution uses the already existing outline curve information. The main idea behind algorithm is to pick correct curves that lay on the outline. This is performed by picking the initial track and adding to the path curves that have the smallest angle between the path end vector and candidate curve. This way outline is collected from available curves in clockwise direction.<br /><br />Library is able to deal with multiple disconnected areas in which case speed decreases several times because of the need to mark inner curves. This could be fixed by implementing initial curve diffusion that would build a neighboring curve graph. This would increase speed both of the outline calculation and used curve marking.</div><div class="ClearBoth"></div>aleksaspielikisTue, 08 Jul 2014 15:35:47 GMTUpdated Wiki: Home 20140708033547P