Subject: Re: [boost] GSoC'19 [Boost.Geometry : Implementing algorithms for the concave hull problem]
From: Vissarion Fisikopoulos (fisikop_at_[hidden])
Date: 2019-03-20 13:02:49
thanks for your interest in the project!
> I had some discussion regarding this with Adam Wulkiewicz. I have read the
> paper ( Moreira, Adriano J. C., and Maribel Yasmina Santos. âConcave hull:
> A k-nearest neighbors approach for the computation of the region occupied
> by a set of points.â) and currently going through the paper âA New Concave
> Hull Algorithm and Concaveness Measure for n-dimensional Datasets*â (
> https://www.iis.sinica.edu.tw/page/jise/2012/201205_10.pdf )) . These are
> the papers given in the project description.
> I am also searching for any other algorithms (newer or better) for the
> concave hull problem. Please direct me to any other algorithms related to
> this project.
by quickly looking at the bibliography is seems that this
is the most efficient algorithm (for 2d which is our focus at least
for now). Please also have a look at alpha-shapes which is a very
closely related topic.
> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk