Need help with delaunay triangulation methods / divide and conquer

[cloud briar]

In the examples shown here I'm already having trouble understanding how to merge the lines and triangles without adding new edges over already existing ones.

It seems like I'm unprepared for this or perhaps just need to know the coding implementation behind this theory , scince I DO understand how it works.

i looked everywhere for a github repository that clearly explains this with clear code and
Comments but cant find any

If there is anything I need to understand first like an algorithm or a subject before delving into implementing this. Please say so and understand that I'm a freshman to this.

[lean sorrel]

what is the data structure for triangles

because y not just check if there is a repeating connection

i doubt there isnt documentation on this

look for research papers/pdfs

you may also find it in a wikipedia page

[cloud briar]

This IS a documentation from a university on the concept , that's how I understood the core mechanics , my only problem is simply finding someone who has implemented it

[lean sorrel]

https://www.youtube.com/watch?v=pPqZPX9DvTg found this

although it is in c

but it should translate fine into lua

im not sure if this is what you mean delaunay triangulation

but it looks like they have a whole series on thsi type of stuff

[cloud briar]

Yes the porting part of it isn't going to be difficult

[cloud briar]

It's dosent include the divide and conquer method but that's okay I'm simply trying to understand the implementation of the core concept first

[cloud briar]

Turns out I have to learn data struct for me to follow along with the vid. As well as a couple of sorting algorithms.

Now I know what to do

Thx