Hi Michaël, Jukka and Stefan,
Sorry for this late reply.
Michaël is right. At the moment, it creates a simple and single polygon as
described in Duckham et al.'s paper.
It'd be possible to extend the current algorithm to create, if needed,
several concave polygons as a result. Spatial clusters
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
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.
[cid:image001.png@01D1D0CE.3B482800]
And it may be that some users would expect the result to be
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
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
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-
