Rebuilding fails on WIN11 with VS 2026

[ikonuk]

I build it and run the VS17 project version last year with VS 2017. It looks like Old Windows SDK is deleted. I tried the V22 project, I get missing SDL2/SDL.h headers.

I also tried to load V17 and V22 projects now using VS 2026 and updated tools version (104) and target to win 22, I get the same eror.

1. Would you have any hint why? Would it also be too much to ask to update it to run with SDL3? (This is not important for me)
2. I think I can manage to use your work without the opengl graphics main/example. I am thinking that I would only need two headers [delabella, predicates] and one cpp file [delabella]. Am I correct?
3. I am thinking/planning to add some code to build a data structure to enable a fast reference mechanism between a rectangular grid and the triangle mesh in an efficient way without screwing up your code. I need it because I am panning to use your code to describe seabed bathmetry (need to add a z-component) and I need to often search for the triangle containing a certain point and calculate its z value. Would you have any recommendation how I should proceed?

Thank you for a great product/work.

[ikonuk]

I created the bare bones app without any problem. I am amazed how fast beladella is. I thank you and congratulate you for such a beautiful piece of work. Thank you!

I am now looking forward to your ideas on how I should proceed to create an app to search for the traingle containing a point (x, y, ...). (I includedd a Z component in my point in the bare bones app. I may add some more elements.)

Happy holidays ...

[ikonuk]

I worked on this a bit more. It is very interesting. I have a question as a result of my experiments.

Is there a way to find out which Voronoid vertex belongs to or sits in which Triangle? I could not figure out the function or meaning of Voronoid indices.

Thanks again.

[ikonuk]

Please disregard my previous questions. I sorted out almost everything. I am only left to ffigure out a way to construct the list of adajecent vertices for a given vertex. Or simply build the adjacency matrix.

More I work on this more I realize how beautiful your code is.

Please execuse me for my awkward questions. I will be 78 next week! Thank you in advance for your help.

[msokalski]

I'm glad to see you solved all previous puzzles. Given the vertex, you can construct an Iterator, which will report all adjacent vertices around the provided one.On Dec 27, 2025 23:45, ikonuk @.***> wrote:ikonuk left a comment (msokalski/delabella#18) Please disregard my previous questions. I sorted out almost everything. I am only left to ffigure out a way to construct the list of adajecent vertices for a given vertex. Or simply build the adjacency matrix. More I work on this more I realize how beautiful your code is. Please execuse me for my awkward questions. I will be 78 next week! Thank you in advance for your help.

—Reply to this email directly, view it on GitHub, or unsubscribe.You are receiving this because you are subscribed to this thread.Message ID: @.***>