Geometry Boost List: Re: [geometry] Geometry Digest, Vol 87, Issue 6

From: Digvijay Janartha (jasonryder555_at_[hidden])
Date: 2020-02-26 14:45:22

Hi Aditya,

> The previous mail in this thread said the Strategies to be used are for
Coordinate System (CS) specifically. Is this something that the Project 2
is looking to address for the Convex Hull algorithm (in order to generalize
it)?

Yes, project 2 clearly says implement convex_hull() for non-cartersian
geometries, which means adding new strategies (for other geometries). Since
currently convex hull structure is not well built in boost, you can also
implement a newer version for convex hull. Also, the concept can be
extended to higher dimensions as well.

As for competency test you need to implement gift wrapping algorithm using
template metaprogramming for Multipoint concept. You can take help from [1]
about the design and structure of boost geometry.
[1]
https://www.boost.org/doc/libs/1_72_0/libs/geometry/doc/html/geometry/design.html

I hope your doubt is cleared.

Regards,
Digvijay

On Wed, Feb 26, 2020 at 5:30 PM <geometry-request_at_[hidden]> wrote:

> Send Geometry mailing list submissions to
>         geometry_at_[hidden]
>
> To subscribe or unsubscribe via the World Wide Web, visit
>         https://lists.boost.org/mailman/listinfo.cgi/geometry
> or, via email, send a message with subject or body 'help' to
>         geometry-request_at_[hidden]
>
> You can reach the person managing the list at
>         geometry-owner_at_[hidden]
>
> When replying, please edit your Subject line so it is more specific
> than "Re: Contents of Geometry digest..."
>
>
> Today's Topics:
>
>    1. Review regarding competency test (Digvijay Janartha)
>    2. Re: Competency Test (Aditya Mohan)
>    3. Re: Competency Test (Mateusz Loskot)
>
>
> ----------------------------------------------------------------------
>
> Message: 1
> Date: Tue, 25 Feb 2020 20:03:31 +0530
> From: Digvijay Janartha <jasonryder555_at_[hidden]>
> To: geometry_at_[hidden]
> Subject: [geometry] Review regarding competency test
> Message-ID:
>         <
> CAKP6d4x2q+4YPMeRZSD0906pwGfs93bvEpUBL6Lxn1gLFJARDg_at_[hidden]>
> Content-Type: text/plain; charset="utf-8"
>
> Hello again,
>
> 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 [1] 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).
> [1]
>
> https://pdfs.semanticscholar.org/2397/17005c3ebd5d6a42fc833daf97a0edee1ce4.pdf
>
> Hoping to hear from mentors soon, @vissarion @awulkiew. And also, where can
> I share the code?
>
> Regards,
> Digvijay
> https://github.com/digu-007
> -------------- next part --------------
> HTML attachment scrubbed and removed
>
> ------------------------------
>
> Message: 2
> Date: Wed, 26 Feb 2020 00:22:01 +0530
> From: Aditya Mohan <adimohan29_at_[hidden]>
> To: "Boost.Geometry library mailing list" <geometry_at_[hidden]>
> Subject: Re: [geometry] Competency Test
> Message-ID:
>         <
> CALvunF_GdmheS3i-S88TSj6J+bgLu6MMWQ1w_76DODMAunfaww_at_[hidden]>
> Content-Type: text/plain; charset="utf-8"
>
> Hello,
>
> I am Aditya Mohan, currently pursuing my undergrad in BITS Goa, India. I
> have contributed to Boost::Geometry by providing examples for the
> documentation of the arithmetic operations - namely the dot and the cross
> product. I look forward to continue contributing to Boost::Geometry as part
> of GSOC 2020. I came across the ideas list released for this year, and
> Project 2 (Implement support for non-cartesian geometries in convex_hull)
> seems like something I can work on during GSOC 2020. I have a clarification
> that I hope you would help me out with. The previous mail in this thread
> said the Strategies to be used are for Coordinate System (CS) specifically.
> Is this something that the Project 2 is looking to address for the Convex
> Hull algorithm (in order to generalize it)? Also, I'd like to know about
> the procedure of allotment of a mentor to guide me through this process.
>
> Thank You,
> Aditya Mohan.
>
>
> On Tue, 18 Feb, 2020, 8:26 PM Vissarion Fisikopoulos via Geometry, <
> geometry_at_[hidden]> wrote:
>
> > Dear Digvijay,
> >
> > Strategies should be used for Coordinate System (CS) specific
> > computations. That is, the algorithm should be CS generic and have a
> > strategy as a parameter. Whenever a CS computation is needed the
> > algorithms should call the strategy to compute it. For example if at
> > some point an algorithm needs to compute the length of a segment this
> > should be done using the strategies.
> >
> > For convex hull this is not implemented, so it is not a good
> > introductory example.
> >
> > Have a look e.g. at line_interpolate_point algorithm or
> > densify to see how this design is implemented.
> >
> > I recommend to implement some (simple) concave hull
> > algorithm using boost.geometry's design but without strategies, only
> > for cartesian CS. Then try to figure out what part should be exported
> > to strategies (that could be done in GSOC if the student's proposal
> > is accepted).
> >
> > Best,
> > Vissarion
> >
> >
> > On Sat, 15 Feb 2020 at 22:15, Digvijay Janartha via Geometry
> > <geometry_at_[hidden]> wrote:
> > >
> > > Hi,
> > >
> > > I wanted to ask what exactly we have to do in programming competency
> > test for Project 1. It states that implement and test "Gift wrapping"
> > Convex hull for MultiPoint Concept, so I need to design a new strategy
> for
> > convex hull (strategy::convex_hull::gift_wrapping) or implement a new
> > algorithm (convex_hull_gift_wrapping), and that too only for MultiPoint
> > Concept? And also this algorithm should be implemented for cartesian
> > coordinate system only, or any other systems also? Also I need to make a
> PR
> > for this (with doxygen commands) or make a different repository for this?
> > And at last, testing will include checking the code output with different
> > existing algorithms? Thanks, in advance!
> > >
> > > Regards,
> > > Digvijay
> > > _______________________________________________
> > > Geometry mailing list
> > > Geometry_at_[hidden]
> > > https://lists.boost.org/mailman/listinfo.cgi/geometry
> > _______________________________________________
> > Geometry mailing list
> > Geometry_at_[hidden]
> > https://lists.boost.org/mailman/listinfo.cgi/geometry
> >
> -------------- next part --------------
> HTML attachment scrubbed and removed
>
> ------------------------------
>
> Message: 3
> Date: Tue, 25 Feb 2020 20:20:09 +0100
> From: Mateusz Loskot <mateusz_at_[hidden]>
> To: "Boost.Geometry library mailing list" <geometry_at_[hidden]>
> Subject: Re: [geometry] Competency Test
> Message-ID:
>         <
> CABUeae81gNqrb9iS+VF08OA-E--nB0cgoerEPDCChQuyTNdyFw_at_[hidden]>
> Content-Type: text/plain; charset="UTF-8"
>
> On Tue, 25 Feb 2020 at 19:53, Aditya Mohan via Geometry
> <geometry_at_[hidden]> wrote:
> >
> > Also, I'd like to know about the procedure of allotment of a mentor to
> guide me through this process.
>
> There is no allotment of a mentor.
>
> Please, you have to read the official GSoC guides for students. All of it.
> You may also find my advice to Boost & GSoC students helpful
> https://lists.boost.org/Archives/boost/2020/02/248236.php
> https://lists.boost.org/boost-users/2020/02/90268.php
>
> Shortly:
> 1. You work on your project idea and preparing project proposal.
>     During this time, you discuss your idea and project here on the list
>      (or general Boost developer's list)
> 2. You submit your proposal to Google
> 3. Mentors review proposals and select students
>
> Best regards,
> --
> Mateusz Loskot, http://mateusz.loskot.net
>
>
> ------------------------------
>
> Subject: Digest Footer
>
> _______________________________________________
> Geometry mailing list
> Geometry_at_[hidden]
> https://lists.boost.org/mailman/listinfo.cgi/geometry
>
>
> ------------------------------
>
> End of Geometry Digest, Vol 87, Issue 6
> ***************************************
>