QT C++ code samples

@Rod,

I made a few examples how to use the linked list in QT, also pointer mode is used.


When reading raw dxf data. So far as i can see the best option is to load the data into a parallel multidimensional array (memory).
It takes about 2 seconds to store 2.000.000 lines of future g-code lines into memory.
This input stay's as it is, unmodified, ready to be transformed into a interactive object later on in the same array, but new dimension.

I must explain my program flow a bit more :

1. Load raw dxf data into memory. During loading it sort's line's, arc's, circle's, cad color's, etc into the array's.
-- Array dimension 1.
2. The cubic formula to sort lines, arc, polyline into object's (closed contours)
-- Array dimension 2.
3. The user defined input's like cw or ccw movements, kerf width, feedrate, spindlespeed, g-code intro, g-code outtro, etc.
--Array dimension 3.

The last array dimension 3 is interactive with user input & opengl.

Rodw :rather than copying data from one array element to another.
This looks not interactive... Copying data from one array to another array would be one way forward, but not interactive backward's.
In my future case it uses a interactive list view (just like a dir view, sub file view) updated by the interactive array, it uses the OpenGL screen update timer.

@Tommy,

I don't use bitcoins for now. I have seen the movie about mtgoxs.

Një ide e mirë do të ishte importimi i djathit të dhisë tek holandezët, kamioni mund të kthehet plot me Heineken në Kosovë.

Yes Tommy,

Cheers !

Cad drawing :


dxfDecoder opengl output :


There was one very difficult part related to arc's to solve for me today, it looked like a bug.
Was only a issue in the opengl output. In the flower you see almost closed arc's. The can give
proglem's when end angle is lower then start angle. Then end angle needs to be made bigger.
Sinds we use radian's it's multiplied by 2*M_PI.
I solved it after hours with this online article.

//if (endAngle < startAngle)
//endAngle += 2*pi;
//https://stackoverflow.com/questions/39344403/opengl-how-fix-direction-draw-circle-semi-circle-arc-from-start-to-end-point-giv

But it's going good. The opengl is full color and does line, arc's and circles. So far so good !!
Up to the next level tomorrow !!

@Project update...

Today i added a few button's to the screen. Google has provided 800 open source button's. So i downloaded them, thanks google !

I added a dxf program logo, that looks nice to me. Mention the multicolor.



The treeview side screen is interactive with the parallel multidimensional array's.

I think i go to work at the contour recognize formula tomorrow... Then the treeview can display closed contours etc.

Attached the program file, if you want to try it.
Unzip and type in terminal : ./DxfDecoder
It will load the drawing by clicking the file opener. Today it has a limited g-code output to 0 lines...

Hi Tommy,

Thanks for your reply !

I have done a stress test for the DxfDecoder.

1200 DxfDecode logo's to load in one sheet of metal.

Pc status :


Now doing the same stress test with sheetcam.
Output of sheetcam :

Pc status :


Sheetcam can not do this job unfortunately. It's still busy after 30 minutes.
My conclusion so far as i can see about the Sheetcam stress test :
It duplicates all the ... vector's, then removes all the ... duplicated vecor's.
It's doing all kind of processes. But it does not read raw dxf data into memory, that's for sure !!
It uses a different procedure, cq program flow.

The last stress test was for the python coded dxf2gode.

Pc status :

No output for this program.

Empty screen for this program.
Conclusion for the Python coded Dxf2Gcode program, It used the most memory related to the other 2 cad/cam program's.

All 3 stress test's where done when youtube was active :


Gëzuar, dhe shpresoj se ne mund të krijojmë diçka të bukur në periudhën e ardhshme.

@Project update..

Me had a hard C and C++ time the last day's. That's a reason to be quiet.

The contour recognize formula was very hard to do. Studied different existing algoritmes, etc.
I made a brand new algoritme from scratch. Off course i made multiple algoritme's from scratch in different styles.....

Now we have a very efficient algoritme. If someone has a idea for a name for this algoritme...



Algoritme output :

Part of the message is hidden for the guests. Please log in or register to see it.


Closed contours can also be :



Part of the message is hidden for the guests. Please log in or register to see it.


And the trick boxs is even bigger. We can make closed contours on tollerance input...
If the opening between point's is 5mm. We can make a closed contour, no problem.





Part of the message is hidden for the guests. Please log in or register to see it.


Up to the next gear....