Hi Satyam, I found that your proposal is similar to me in many aspect. I think the same pattern of GSoC proposal is common, and it does not matter, but your proposal has too many same description as me. And you did not code for programming competency test, but have the same idea of implement of test. Do not you think these behaviors means copy??? ``` your programming interest I really enjoy exploring new Mathematical formulation and then converting these algorithms to codes. I ‘m a huge fan of C/C++ because of its speed of computation and So, I always wanted to contribute in development of C++. I have used Boost modules of Big Integer etc and these modules were easy to use and are really nicely built. It would be great pleasure to contribute in such open-source project which determines the future of your favourite language. I also want to challenge my programming capabilities on different aspects. Definitely, I did not have experience contributing to open source community, I will try my best to communicate and learn! As I am good at mathematical algorithms like geometry, so I decided to take up the project in Boost.Geometry. The project presents a really challenging and interesting problem to me. So I decided to learn how to solve it. It would be really great if my code can help others and be a part of boost libraries for me. So I decided to take up this project. ``` ``` my programming inerest I am extremely enjoy learning and spending time on algorithms using C++, and I also want to challenge my programming capabilities in different aspects. Once I found Boost, a set of algorithms libraries for C++, I knew these is a good opportunity for me. Definitely, I did not have experience contributing to open source community, I will try my best to communicate and learn! For I am good at mathematical algorithms like geometry, so I decided to propose the project of Boost.Geometry. After I finished the Programming Competency Test from Boost.Geometry, I read the source code of Boost.Geometry, I found there have plenty basic geometry formula. But it is better if we can reduce the time complexity by calculating for different conditions or using other methods. So I decide to contribute to project1 to avoid expensive geographic distance calculation whenever possible. ``` ``` your milestone and timeline Community Bonding Period (May 4 to May 29, 2017) 1. Thoroughly understand Boost.Geometry libraries and architecture by source code and documents. 2. Completely and thoroughly understand the research paper of Charles F. F. Karney 3. Learn meta-programming and other essential knowledge of C++. 4. Get familiar with Boost community. Official Coding Period (May 30 to August 21, 2017)Official Coding Period Phase 1 (May 30 to June 26, 2017) Week 1 (May 30 to June 5, 2017): 1. Learn how to create documentation and tests. 2. Create initial documentation. Week 2 (June 6 to June 13, 2017): 1. Implement Horner’s Method. Week 3 to 4 (June 13 to June 27, 2017): 1. Design the test data, and get the code reviewed.. 2. Test the method and Check the section to fit the architecture of Boost. 3. Learn differential geodesic geometry to understand the concept of reduced length. Milestone 1: Finished implementing Horner’s MethodOfficial Coding Period Phase 2 (June 27 to July 24, 2017) Week 5 to 6 (June 27 to July 18, 2017): 1. Start Implementing Newton's Method. 2. Create documentation for this section. Week 6 to 8 (July 18 to July 24, 2017): 1. Design the test data, and get the code reviewed. 2. Test the method and Check the section to fit the architecture of Boost. 3. Analyze the test data, guarantee the correctness of codes. Milestone 2: Finished implementing Newton’s MethodOfficial Coding Period Phase 3 (July 25 to August 21, 2017) Week 9 to 11 (July 25 to August 14, 2017): 1. Implement Helmert’s solution. 2. Decide the condition when to use it as start guess 3. Design the test data, and get the code reviewed. 4. Test the method and Check the section to fit the architecture of Boost. 5. Analyze the test data, guarantee the correctness of code. Week 11 to 12 (August 15 to August 21, 2017): 1. Fix bugs and documentation details. 2. Prepare for final delivery. Milestone 3: Completed implementation of the module. ``` ``` my milestone and schedule Community Bonding Period (May 4 to May 29, 2017): 1. Through understand Boost.Geometry libraries and architecture by source code and documents. 2. Make a wiki page (TODO lists and weekly reports). 3. Learn meta-programming and other essential knowledge of C++. 4. Get familiar with development for Boost community. 5. Understand the algorithms of map projection and mathematical calculation on ellipsoid. Official Coding Period (May 30 to August 21, 2017): Official Coding Period Phase 1 (May 30 to June 26, 2017): Week 1 (May 30 to June 5, 2017): 1. Learn how to create documentation and tests. 2. Create initial documentation. Week 2 to 3 (June 6 to June 19, 2017): 1. Implement Condition Division. 2. Check the section to fit the architecture of Boost. 3. Create documentation for these section. Week 4 (June 20 to June 26, 2017): 1. Design the test data, and review the code. 2. Analyze the test data to define when fall back to expensive geographic distance calculation or return the result by comparing approximately. Milestone 1: Finished implement Condition Division and define “far enough”. Official Coding Period Phase 2 (June 27 to July 24, 2017): Week 5 (June 27 to July 10, 2017): 1. Learn differential geometry, check the geodesic segments of two points whether can get a cross-section through the center of ellipsoid, and whether the cross-section is ellipse that we can calculate the sectorial area easy to compare. 2. Create documentation for this section. Week 6 to 8 (July 11 to July 24, 2017): 1. Implement the algorithm of Calculation with Sectorial Area. 2. Design the test data, and review the code. 3. Analyze the test data, guarantee the correct of algorithms. Milestone 2: Finished implement Calculation with Sectorial Area. Official Coding Period Phase 3 (July 25 to August 21, 2017): Week 9 to 10 (July 25 to August 7, 2017): 1. Implement the architecture of Calculation with Performing a local spheroid approximation and return the 2D distance by map projection. 2. Implement the algorithm of Azimuthal equidistant projection accommodate equatorial. 3. Implement the algorithm of Azimuthal equidistant projection accommodate polar. 4. Implement the algorithm of Azimuthal equidistant projection accommodate oblique. 5. Implement the algorithm of Two-point equidistant projection 6. Create documentation for this section. Week 11 (August 8 to August 14, 2017): 1. Design the test data, and review the code. 2. Analyze the test data, guarantee the correct of algorithms. Week 11 to 12 (August 15 to August 21, 2017): 1. Fix bugs and documentation details. 2. Prepare for final delivery. Milestone 3: Finished implement Calculation with Performing a local spheroid approximation and return the 2D distance by map projection. ``` Above all I received two emails from google docs. Sorry for my language is Chinese. The meaning of this email is Satyam Pandey do a replace:replace “Dev Environment Visual Studio for C# development Eclipse for JAVA development Code Blocks, Sublime T…” to“`+” On Sun, Apr 2, 2017 at 8:06 PM, Satyam Pandey (Google 文档) < d+MTA0OTYzMTEyNjU1MDQ4ODM2NjY4-MTE2NjIwMzk2NDMwMjUwNDI3MDcx@docs.google.com> wrote:
Satyam Pandey向“Proposal https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJbrW7k/edit?disco=AAAAA9C1YwA&usp=comment_email_document ”添加了一条建议 [image: Satyam Pandey] Satyam Pandey
替换：将“Dev Environment Visual Studio for C# development Eclipse for JAVA development Code Blocks, Sublime T…”替换为“`+”
打开 https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJbrW7k/edit?disco=AAAAA9C1YwA&usp=suggestion_email_discussion Google Inc. 1600 Amphitheatre Parkway, Mountain View, CA 94043, USA
您收到此邮件是因为您订阅了有关“Proposal https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJbrW7k/edit?disco=AAAAA9C1YwA&usp=comment_email_document ”的所有讨论。更改 Google 文档向您发送的内容。 https://docs.google.com/document/docos/notify?id=1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJbrW7k&title=Proposal 您可以通过回复此邮件来参与讨论。
--
Northwest University of China
Software Engineering
jingry0321@gmail.com
Satyam Pandey拒绝了“Proposal https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJbrW7k/edit?disco=AAAAA9C1YwA&usp=comment_email_document ”中的建议 [image: Satyam Pandey] Satyam Pandey
替换：将“Dev Environment Visual Studio for C# development Eclipse for JAVA development Code Blocks, Sublime T…”替换为“`+”
[image: Satyam Pandey] Satyam Pandey
*已拒绝建议* 打开 https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJbrW7k/edit?disco=AAAAA9C1YwA&usp=suggestion_email_discussion Google Inc. 1600 Amphitheatre Parkway, Mountain View, CA 94043, USA
您收到此邮件是因为您订阅了有关“Proposal https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJbrW7k/edit?disco=AAAAA9C1YwA&usp=comment_email_document ”的所有讨论。更改 Google 文档向您发送的内容。 https://docs.google.com/document/docos/notify?id=1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJbrW7k&title=Proposal 您可以通过回复此邮件来参与讨论。
--
Northwest University of China
Software Engineering
jingry0321@gmail.com
Hi all, I want to contribute to the project "Nearly antipodal points distance accuracy improvement."
I have attached my proposal in the mail. I request the mentors to review my proposal. I know I'm pretty late to start. But it would be great help if you can review my proposal and suggest the changes if required.
Proposal : https://docs.google.com/document/d/19WYR0RHINxqhtu0SIN0ZUxYMNKxAf 1LOBPGl7j7hh6U/edit?usp=sharing
Thanks Satyam Pandey
-- View this message in context: http://boost.2283326.n4. nabble.com/gsoc2017-Please-review-my-proposal-for- project-Nearly-antipodal-points-distance-accuracy- improvement-tp4693352.html Sent from the Boost - Dev mailing list archive at Nabble.com.
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/ mailman/listinfo.cgi/boost
--
Northwest University of China
Software Engineering
jingry0321@gmail.com
