[gsoc18] Seeking a mentor for Boost.Geometry project 2: Nearly antipodal points distance accuracy improvement
Greetings, Congratulations to the Boost community on being selected for GSoC 2018! I recently read through the project ideas listed on the Wiki page, I'm particularly interested in "Boost.Geometry Project 2: Nearly antipodal points distance accuracy improvement". I wanted to know if I should implement a particular algorithm for finding the shortest distance between two points? There are many options, such as the Haversine formula, Equirectangular approximation, and Rhumb line. Or, would any of these be fine? Additionally, could the mentor please let me know on how to share the code? I was thinking of creating a GitHub repository, this would make it easier for the mentor to provide feedback. Would that be alright? I was also a participant in GSoC 2017 with the OpenAstronomy organization. My project was to design and create a Python client for Hierarchical Progressive Surveys. It enabled users to view astronomical figures in an interactive environment. More details of the software package can be found here (https://hips.readthedocs.io/en/latest/getting_started.html). I look forward to your reply. Kind regards, Adeel
Hello,
Congratulations to the Boost community on being selected for GSoC 2018! I recently read through the project ideas listed on the Wiki page, I'm particularly interested in "Boost.Geometry Project 2: Nearly antipodal points distance accuracy improvement".
thank you for your interest in that project.
I wanted to know if I should implement a particular algorithm for finding the shortest distance between two points? There are many options, such as the Haversine formula, Equirectangular approximation, and Rhumb line. Or, would any of these be fine?
The test description was intentionally left vague to encourage the student to search for available methods and choose the one that computes the shortest path. Implement few of them and provide some simple comparison is also encouraged. There is not a single best solution to the test but we would like to check your methodology to attach the problem.
Additionally, could the mentor please let me know on how to share the code? I was thinking of creating a GitHub repository, this would make it easier for the mentor to provide feedback. Would that be alright?
This is already answered to this list ;) But once more: github is fine. Best, Vissarion.
I was also a participant in GSoC 2017 with the OpenAstronomy organization. My project was to design and create a Python client for Hierarchical Progressive Surveys. It enabled users to view astronomical figures in an interactive environment. More details of the software package can be found here (https://hips.readthedocs.io/en/latest/getting_started.html).
I look forward to your reply.
Kind regards,
Adeel
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Hello Vissarion, Thank you for the reply. I have started implementing the library to compute shortest distance between two given points on the Earth's surface (I've named it GeoLib). For now, I have implemented five methods for computing the geographical distance, namely, the Haversine formula, Spherical Law of Cosines, Equirectangular approximation, Ellipsoidal approximation, and the Tunnel distance. These methods assume a variety of models of the Earth's surface e.g. flat, spherical, and ellipsoidal. For testing the above methods, I have used the Boost Test library. All of the test cases are passing. In addition to this, I have added Doxygen documentation to my code. My next step is to introduce the LinestringPointInterpolation method. I have added you as a collaborator to my repository on GitHub (https://github.com/adl1995/boost-geometry-proposal/invitations). If you have any suggestions / feedback regarding the current implementation or want me to add additional benchmarks for the distance methods, please let me know. Thank you, Adeel ________________________________ From: Vissarion Fisikopoulos <fisikop@gmail.com> Sent: Friday, February 16, 2018 2:03 PM To: boost@lists.boost.org Cc: Adeel Ahmad Subject: Re: [boost] [gsoc18] Seeking a mentor for Boost.Geometry project 2: Nearly antipodal points distance accuracy improvement Hello,
Congratulations to the Boost community on being selected for GSoC 2018! I recently read through the project ideas listed on the Wiki page, I'm particularly interested in "Boost.Geometry Project 2: Nearly antipodal points distance accuracy improvement".
thank you for your interest in that project.
I wanted to know if I should implement a particular algorithm for finding the shortest distance between two points? There are many options, such as the Haversine formula, Equirectangular approximation, and Rhumb line. Or, would any of these be fine?
The test description was intentionally left vague to encourage the student to search for available methods and choose the one that computes the shortest path. Implement few of them and provide some simple comparison is also encouraged. There is not a single best solution to the test but we would like to check your methodology to attach the problem.
Additionally, could the mentor please let me know on how to share the code? I was thinking of creating a GitHub repository, this would make it easier for the mentor to provide feedback. Would that be alright?
This is already answered to this list ;) But once more: github is fine. Best, Vissarion.
I was also a participant in GSoC 2017 with the OpenAstronomy organization. My project was to design and create a Python client for Hierarchical Progressive Surveys. It enabled users to view astronomical figures in an interactive environment. More details of the software package can be found here (https://hips.readthedocs.io/en/latest/getting_started.html).
I look forward to your reply.
Kind regards,
Adeel
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Hello Vissarion, I have made a pull request adding the changes you pointed out in the "Review 1" issue (https://github.com/adl1995/boost-geometry-proposal/pull/3). Listed below are the tasks I performed: - Implemented the Vincenty's formula - Added test for Boost Geometry algorithms. I tested again these policies: vincenty, thomas, and andoyer - Tested the code against an extensive dataset from (https://zenodo.org/record/32156#.Wpq_DuaYPrf). For now, I have used 150 records - Used global fixtures to remove code repetitivity I had to tune the tolerance for each formula. The least accurate was Ellipsoidal project, which makes sense as it's mentioned on its Wikipedia page: "The FCC prescribes the following formulae for distances not exceeding 475 kilometres". The most accurate method was Vincenty's formula. However, I noted that my implementation of the formula was tolerant up to 1e-9, whereas the Boot Geometry implementation was tolerant up till 1e-5. I used the same dataset for all the tests. Could you please review the pull request and suggest further changes / improvements? I have applied templates to all classes, but they aren't very useful yet. I'm thinking of allowing input in multiple formats e.g. in (degrees, minutes, seconds) and degrees. Thank you, Adeel ________________________________ From: Adeel Ahmad <adeelahmad14@hotmail.com> Sent: Monday, February 19, 2018 11:55 PM To: Vissarion Fisikopoulos Cc: boost@lists.boost.org Subject: Re: [boost] [gsoc18] Seeking a mentor for Boost.Geometry project 2: Nearly antipodal points distance accuracy improvement Hello Vissarion, Thank you for the reply. I have started implementing the library to compute shortest distance between two given points on the Earth's surface (I've named it GeoLib). For now, I have implemented five methods for computing the geographical distance, namely, the Haversine formula, Spherical Law of Cosines, Equirectangular approximation, Ellipsoidal approximation, and the Tunnel distance. These methods assume a variety of models of the Earth's surface e.g. flat, spherical, and ellipsoidal. For testing the above methods, I have used the Boost Test library. All of the test cases are passing. In addition to this, I have added Doxygen documentation to my code. My next step is to introduce the LinestringPointInterpolation method. I have added you as a collaborator to my repository on GitHub (https://github.com/adl1995/boost-geometry-proposal/invitations). If you have any suggestions / feedback regarding the current implementation or want me to add additional benchmarks for the distance methods, please let me know. Thank you, Adeel ________________________________ From: Vissarion Fisikopoulos <fisikop@gmail.com> Sent: Friday, February 16, 2018 2:03 PM To: boost@lists.boost.org Cc: Adeel Ahmad Subject: Re: [boost] [gsoc18] Seeking a mentor for Boost.Geometry project 2: Nearly antipodal points distance accuracy improvement Hello,
Congratulations to the Boost community on being selected for GSoC 2018! I recently read through the project ideas listed on the Wiki page, I'm particularly interested in "Boost.Geometry Project 2: Nearly antipodal points distance accuracy improvement".
thank you for your interest in that project.
I wanted to know if I should implement a particular algorithm for finding the shortest distance between two points? There are many options, such as the Haversine formula, Equirectangular approximation, and Rhumb line. Or, would any of these be fine?
The test description was intentionally left vague to encourage the student to search for available methods and choose the one that computes the shortest path. Implement few of them and provide some simple comparison is also encouraged. There is not a single best solution to the test but we would like to check your methodology to attach the problem.
Additionally, could the mentor please let me know on how to share the code? I was thinking of creating a GitHub repository, this would make it easier for the mentor to provide feedback. Would that be alright?
This is already answered to this list ;) But once more: github is fine. Best, Vissarion.
I was also a participant in GSoC 2017 with the OpenAstronomy organization. My project was to design and create a Python client for Hierarchical Progressive Surveys. It enabled users to view astronomical figures in an interactive environment. More details of the software package can be found here (https://hips.readthedocs.io/en/latest/getting_started.html).
I look forward to your reply.
Kind regards,
Adeel
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Hello Vissarion and Adam, I just submitted my proposal for the "Nearly antipodal points distance accuracy improvement" project. It would be greatly appreciated if you could provide feedback regarding any changes that are required. For the project, I have proposed to implement the direct and inverse geodesic problems, and a method for computing the area of a geodesic polygon using the method proposed by Karney [1]. I think the Project Proposal and Timeline section would require further revisions. Also, please let me know if I need to further explain the direct and inverse geodesic methods. At the moment, I have an abstract understanding of the process, but I am going through other papers to connect all the dots. [1] https://arxiv.org/pdf/1109.4448.pdf Thank you, Adeel arXiv:1109.4448v2 [physics.geo-ph] 28 Mar 2012<https://arxiv.org/pdf/1109.4448.pdf> arxiv.org arXiv:1109.4448v2 [physics.geo-ph] 28 Mar 2012 Link http://geographiclib.sourceforge.net/geod.html E-print arXiv:1109.4448 Algorithms for geodesics ________________________________ From: Adeel Ahmad <adeelahmad14@hotmail.com> Sent: Saturday, March 3, 2018 8:50 PM To: Vissarion Fisikopoulos Cc: boost@lists.boost.org Subject: Re: [boost] [gsoc18] Competency task update: Nearly antipodal points distance accuracy improvement Hello Vissarion, I have made a pull request adding the changes you pointed out in the "Review 1" issue (https://github.com/adl1995/boost-geometry-proposal/pull/3). Listed below are the tasks I performed: - Implemented the Vincenty's formula - Added test for Boost Geometry algorithms. I tested again these policies: vincenty, thomas, and andoyer - Tested the code against an extensive dataset from (https://zenodo.org/record/32156#.Wpq_DuaYPrf). For now, I have used 150 records - Used global fixtures to remove code repetitivity I had to tune the tolerance for each formula. The least accurate was Ellipsoidal project, which makes sense as it's mentioned on its Wikipedia page: "The FCC prescribes the following formulae for distances not exceeding 475 kilometres". The most accurate method was Vincenty's formula. However, I noted that my implementation of the formula was tolerant up to 1e-9, whereas the Boot Geometry implementation was tolerant up till 1e-5. I used the same dataset for all the tests. Could you please review the pull request and suggest further changes / improvements? I have applied templates to all classes, but they aren't very useful yet. I'm thinking of allowing input in multiple formats e.g. in (degrees, minutes, seconds) and degrees. Thank you, Adeel ________________________________ From: Adeel Ahmad <adeelahmad14@hotmail.com> Sent: Monday, February 19, 2018 11:55 PM To: Vissarion Fisikopoulos Cc: boost@lists.boost.org Subject: Re: [boost] [gsoc18] Seeking a mentor for Boost.Geometry project 2: Nearly antipodal points distance accuracy improvement Hello Vissarion, Thank you for the reply. I have started implementing the library to compute shortest distance between two given points on the Earth's surface (I've named it GeoLib). For now, I have implemented five methods for computing the geographical distance, namely, the Haversine formula, Spherical Law of Cosines, Equirectangular approximation, Ellipsoidal approximation, and the Tunnel distance. These methods assume a variety of models of the Earth's surface e.g. flat, spherical, and ellipsoidal. For testing the above methods, I have used the Boost Test library. All of the test cases are passing. In addition to this, I have added Doxygen documentation to my code. My next step is to introduce the LinestringPointInterpolation method. I have added you as a collaborator to my repository on GitHub (https://github.com/adl1995/boost-geometry-proposal/invitations). If you have any suggestions / feedback regarding the current implementation or want me to add additional benchmarks for the distance methods, please let me know. Thank you, Adeel ________________________________ From: Vissarion Fisikopoulos <fisikop@gmail.com> Sent: Friday, February 16, 2018 2:03 PM To: boost@lists.boost.org Cc: Adeel Ahmad Subject: Re: [boost] [gsoc18] Seeking a mentor for Boost.Geometry project 2: Nearly antipodal points distance accuracy improvement Hello,
Congratulations to the Boost community on being selected for GSoC 2018! I recently read through the project ideas listed on the Wiki page, I'm particularly interested in "Boost.Geometry Project 2: Nearly antipodal points distance accuracy improvement".
thank you for your interest in that project.
I wanted to know if I should implement a particular algorithm for finding the shortest distance between two points? There are many options, such as the Haversine formula, Equirectangular approximation, and Rhumb line. Or, would any of these be fine?
The test description was intentionally left vague to encourage the student to search for available methods and choose the one that computes the shortest path. Implement few of them and provide some simple comparison is also encouraged. There is not a single best solution to the test but we would like to check your methodology to attach the problem.
Additionally, could the mentor please let me know on how to share the code? I was thinking of creating a GitHub repository, this would make it easier for the mentor to provide feedback. Would that be alright?
This is already answered to this list ;) But once more: github is fine. Best, Vissarion.
I was also a participant in GSoC 2017 with the OpenAstronomy organization. My project was to design and create a Python client for Hierarchical Progressive Surveys. It enabled users to view astronomical figures in an interactive environment. More details of the software package can be found here (https://hips.readthedocs.io/en/latest/getting_started.html).
I look forward to your reply.
Kind regards,
Adeel
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
participants (2)
-
Adeel Ahmad -
Vissarion Fisikopoulos