GSoC'19 [Boost.Geometry : Implementing algorithms for the concave hull problem]
Hi, I am interested in contributing to Boost.Geometry and would like to work on the Project 1 (Implementing algorithms for the concave hull problem) as my GsoC’19 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. Regards Yaghyavardhan
Hi Yaghyavardhan, 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 https://www.researchgate.net/publication/220600217_Efficient_generation_of_s... 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. Best, Vissarion
Regards
Yaghyavardhan
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Hi I have read all the three algorithms (2 from the paper give in project description and the 1 mentioned by Vissarion) and also made a description of the algorithms,attacehd is the pdf for the same. Please guide me on what more I should add in the description (I will be adding the pseudocode for the algorithms in my proposal) . I am currently reading about the performance of these algorithms, to select the one which would be best for this project. Please help me in selecting the algorithm. Regards Yaghyavardhan On Wed, 20 Mar 2019 at 18:32, Vissarion Fisikopoulos <fisikop@gmail.com> wrote:
Hi Yaghyavardhan,
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
https://www.researchgate.net/publication/220600217_Efficient_generation_of_s... 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.
Best, Vissarion
Regards
Yaghyavardhan
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Hi I have submitted the first draft of my proposal for the project Implementing algorithms for Concave Hull Problem in Boost.Geometry. Here is the overleaf link <https://www.overleaf.com/read/qfnypymyxqjz?ws=fallback> for the same.It would be really helpful if you could please review it and suggest any improvements. Thanking you in advance. Regards, Yaghyavardhan On Wed, 27 Mar 2019 at 05:30, yaghyavardhan singh khangarot < yaghyavardhan.singh@research.iiit.ac.in> wrote:
Hi
I have read all the three algorithms (2 from the paper give in project description and the 1 mentioned by Vissarion) and also made a description of the algorithms,attacehd is the pdf for the same. Please guide me on what more I should add in the description (I will be adding the pseudocode for the algorithms in my proposal) .
I am currently reading about the performance of these algorithms, to select the one which would be best for this project. Please help me in selecting the algorithm.
Regards
Yaghyavardhan
On Wed, 20 Mar 2019 at 18:32, Vissarion Fisikopoulos <fisikop@gmail.com> wrote:
Hi Yaghyavardhan,
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
https://www.researchgate.net/publication/220600217_Efficient_generation_of_s... 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.
Best, Vissarion
Regards
Yaghyavardhan
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
participants (2)
-
Vissarion Fisikopoulos -
yaghyavardhan singh khangarot