Posted by ElvJOGL on Feb 10, 2016; 4:01pm
URL: https://forum.jogamp.org/Extending-Functionality-of-Shader-Programs-tp4036139p4036149.html

Wow you seem very much interested in my project.

Thank you for all the opinions you have provide.

Another question is: is possible to write a shaders by fragments. Because as you know, as the geometry lets say from my professor terms, H Fold 100, and because for a 3 vertices polygon such as a triangle produces 3^100 a integer number of 48 to 49 digits long, that is the number of vertices that she wants to work with.

For instance, in java I am able to do this project, but only for a small H Fold (I will explain what the H Fold algorithm that we have is all about and how it produces the pixels that lie inside the polygon).

And because I can only do it for a small H Fold like (10), once I push the program (java) to compute something larger then H Fold 10, there is a memory barrier. So my other professor who is not involved in this project, but who is the chair of the Math and Comp Science department said, that this project is virtually impossible. So they both are not giving me much hope. However, I have been asked to solve this issue. As the Chair said, you don't need computer programming skill to solve the issue, you need mathematical skill to produce mathematical shortcut to solve the issue.

That's one of my problems.

I have a vague Idea, but I don't know whether it will work. (I don't want to discuss it until I come up with a working example of the program that I need to build.

Now to explain to you what the H Fold is all about.

The H Fold is an algorithm (in mathematics) which takes the 3 vertices of a triangle and adds them to each other, which produces are larger triangle. For example you have vertices of the initial triangle such as {{-1,1}, {-1, -1}, {1, 1}}.

So this is how the algorithm goes: You take {-1, 1} which is the first vertex and added {-1, 1}, {-1, -1}, {1, 1}, which produces {-2, 2}, {-2, 0}, {0, 2}, then the following set is from vertex {-1, -1}, which are {-2, 0}, {-2, -2}, {0, 0}, and the last set follows as {0, 2}, {0, 0}, {2, 2}.

So what is call the Sum Set you have {{{-2, 2}, {-2, 0}, {0, 2}}, {{-2, 0}, {-2, -2}, {0, 0}}, {{0, 2}, {0, 0}, {2, 2}}}

That is a sum set.

Now the H Fold Sum Set is just the loop which will repeat the same process now to the 9 vertices triangle that you ended up with, which will produce a sum set of vertices of 27, then 81, and so on. This because it is a triangle starting with 3 vertices all the expansions of the sum set are multiples of 3, that is why when you produce an H Fold Sum Set of 100, you are actually calculating a number of vertices of 3 to the power of 100.

I hope this interest you much.

The problem itself is not complicated since I already did it in Java for a small H Fold. But my professor who is doing the research on this has asked me to do it for H Fold 100 and above, which is a huge mathematical problem all over the world as she says, that has not been solved.

Now why would a professor asked a simple student to try to handle a problem that requires super computers, I have no idea. But I like the idea that she personally asked me to help her, so I am trying my best to learn what ever it takes to solve this issue.

Thank you.