Please help, i used NetTopologySuite.Algorithm.ConvexHull, what i need is something like ConcavHull?

123 views
Skip to first unread message

loth...@gmail.com

unread,
Feb 13, 2015, 5:54:21 AM2/13/15
to nettopol...@googlegroups.com
Hello,

i'm not very used to using GeoAPI. the solution to my task using the ConvexHull-function is not optimal. can anyone help me?

to begin with: i have two sets of points/coordinates. green-ones and red-ones. i am looking for a polygon that includes alle green points. ConvexHull creates a polygon that includes all green points as well as a lot of red points.



the minimal polygon that includes all green points would serve me better.

any suggestions what function to use, how to get there in steps, how to implement something like ConcavHull?


FObermaier

unread,
Feb 13, 2015, 9:16:48 AM2/13/15
to nettopol...@googlegroups.com
Here you find a java implementation for ConcaveHull that is based on JTS:
https://github.com/skipperkongen/jts-algorithm-pack
It shouldn't be too hard to port it to NTS.
Reply all
Reply to author
Forward
0 new messages