thanks for your interest in Boost.Geometry and projects 1, 3 in particular.
Do you have particular preference between 1 and 3? I think you should
specify in your application.
Regarding you idea, indeed that could be an option. Do you expect that
be faster or more accurate than the one proposed in the boost GSoC ideas
webpage? How would you compare the two approaches? To be clear, I am
not testing you but answering that questions could lead to a stronger
Regarding application there are two options, either you do the competency
test or you send a link of a project of you. Please read
https://svn.boost.org/trac/boost/wiki/SoC2017 (and links
therein) also for details on how to proceed, that is on how to write your
ps. I copy to the boost list for potential feedback from the community
On 20 March 2017 at 13:07, Aman Gupta via Geometry <[hidden email] > wrote:
> Respected sir/ma'am
> I, Aman Gupta, want to contribute in Boost.Geometry; mainly in Project 1(Filtering
> of compare distance predicates) and Project 3( Nearly antipodal points
> distance accuracy improvement) .
> I have good knowledge in geometry and want to learn more .
> For the problem given in Project 1, another approach I can suggest is to
> get 2 intersections of plane (which would be ellipse) with the help given
> points and compute the respective distances using those ellipses.
> I hope to get selected for the project work.
> Thanking You.
> AMAN GUPTA
> resume: https://drive.google.com/open?id=0B9HCqOWnVVvDcm9PQkYtczFjVmM >
> Geometry mailing list
> [hidden email] > http://lists.boost.org/mailman/listinfo.cgi/geometry >