I want to know what algorithm is used by the join function?

[huntto]

https://doc.cgal.org/latest/Boolean_set_operations_2/Boolean_set_operations_2_2set_union_8cpp-example.html

[efifogel]

We use CGAL 2D arrangements to carry out (regularized) Boolean operations. Each face of the arrangement is extended with a Boolean flag that indicates whether it is included in the point set. When computing the 'join' (or any other operation) we first construct an arrangement for each polygon input. Then, we use the CGAL::overlay() free function to overlay the arrangements associated with the input polygons. ____ _ ____ _ /_____/_) o /__________ __ // (____ ( ( ( (_/ (_/-(-'_(/ _/

…

On Mon, 13 Nov 2023 at 04:01, Huntto ***@***.***> wrote: https://doc.cgal.org/latest/Boolean_set_operations_2/Boolean_set_operations_2_2set_union_8cpp-example.html — Reply to this email directly, view it on GitHub <#7857>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/ABVBNOGGLZ2LYRUBUR7UWGDYEF5ONAVCNFSM6AAAAAA7IONIXGVHI2DSMVQWIX3LMV43ERDJONRXK43TNFXW4OZVHA2DIOBYHA> . You are receiving this because you are subscribed to this thread.Message ID: ***@***.***>