thanks for explaining Jukka! Makes sense. But how to implement that...
phewww... not sure.
On 6/27/16 17:54, Rahkonen Jukka (MML) wrote:
Hi Stefan,
Actually the issue was that without playing with densification and
tolerance (which is documented) the result did contain all the
vertices but not the whole area of the polygons.
And it may be that some users would expect the result to be something like
I guess that it is hard to define how the result should be as a basis
for the algorithm. Perhaps “follow the shapes as closely as possible
while keeping the perimeter of the linear ring below threshold [].
-Jukka Rahkonen-
Stefan Steiniger wrote:
Hi,
actually the question is: What do you expect for a result, Jukka? The
picture by Michaël seems reasonable to me and I wonder how it should
look for you.
cheers.,
Stefan
On 6/23/16 17:30, Michaël Michaud wrote:
Hi Jukka,
As far as I remember (I did not find confirmation in Eric's
documentation), the algorithm produces a single polygon.
In your case, there are several input polygons. If you densify
their boundaries, you'll get something close to the original
polygons, but with narrow corridors to rely them. I think this is
a limitation of the algorithm rather than a bug. Here is what I
get with a densification of 1m. Would be interesting to overcome
this limitation though.
Le 23/06/2016 à 14:50, Rahkonen Jukka (MML) a écrit :
Hi,
I was playing with the Concave hull plugin and got usually
good results. However, the attached data gives odd results
even if I followed the hint to densify the geometries. Sending
to the list if some developers happens to be interested in
having a look.
-Jukka Rahkonen-
------------------------------------------------------------------------------
Attend Shape: An AT&T Tech Expo July 15-16. Meet us at AT&T Park in San
Francisco, CA to explore cutting-edge tech and listen to tech luminaries
present their vision of the future. This family event has something for
everyone, including kids. Get more information and register today.
http://sdm.link/attshape
_______________________________________________
Jump-pilot-devel mailing list
Jump-pilot-devel@lists.sourceforge.net
<mailto:Jump-pilot-devel@lists.sourceforge.net>
https://lists.sourceforge.net/lists/listinfo/jump-pilot-devel
------------------------------------------------------------------------------
Attend Shape: An AT&T Tech Expo July 15-16. Meet us at AT&T Park in San
Francisco, CA to explore cutting-edge tech and listen to tech luminaries
present their vision of the future. This family event has something for
everyone, including kids. Get more information and register today.
http://sdm.link/attshape
_______________________________________________
Jump-pilot-devel mailing list
Jump-pilot-devel@lists.sourceforge.net
<mailto:Jump-pilot-devel@lists.sourceforge.net>
https://lists.sourceforge.net/lists/listinfo/jump-pilot-devel
------------------------------------------------------------------------------
Attend Shape: An AT&T Tech Expo July 15-16. Meet us at AT&T Park in San
Francisco, CA to explore cutting-edge tech and listen to tech luminaries
present their vision of the future. This family event has something for
everyone, including kids. Get more information and register today.
http://sdm.link/attshape
_______________________________________________
Jump-pilot-devel mailing list
Jump-pilot-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/jump-pilot-devel
------------------------------------------------------------------------------
Attend Shape: An AT&T Tech Expo July 15-16. Meet us at AT&T Park in San
Francisco, CA to explore cutting-edge tech and listen to tech luminaries
present their vision of the future. This family event has something for
everyone, including kids. Get more information and register today.
http://sdm.link/attshape
_______________________________________________
Jump-pilot-devel mailing list
Jump-pilot-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/jump-pilot-devel
