From: Digvijay Janartha (jasonryder555_at_[hidden])
Date: 2020-02-25 14:33:31
I am Digvijay Janartha, my latest PR about missing documentation in boost
geometry got merged two weeks ago. I am currently pursuing my graduation
from National Institute of Technology, Hamirpur, India in Computer Science
and engineering and studying in pre-final year.
I'm preparing to make proposal for concave hull algorithms (Project 1) for
GSoC 2020. I have contacted to Vissarion about Competency test and he told
me that implementing the gift wrapping convex hull would be rather off
topic for me and I should rather work on some easy concave hull algorithm
and make hpp file for that using boost geometry design for 2D cartesian CS
and if I get selected then I can work on adding strategies and more
algorithms during GSoC period.
I have made a private repository to do this task, I have currently built
the concave hull algorithm using K- nearest neighbour algorithm  for 2D
cartesian CS and for Multipoint Concept (only header file using C++
template metaprogramming). I just wanted to ask for review about my current
work and have a look if I'm going in the right direction, I have created
some pngs to show the working of concave hull on a ~150 points dataset as
well (for 5 different k values) and guide me if such work will be accepted
for Competency test (with complete documentation and examples).
Hoping to hear from mentors soon, @vissarion @awulkiew. And also, where can
I share the code?
Geometry list run by mateusz at loskot.net