Comments by Sir Roland (Top 20 by date)

Thanks for your input. Apparently I don't have the ability to communicate I though I have. You are not answering the question, so perhaps I didn't state it well. This is being done as part of some academic work.

I am calculating millions of points to get an image of about 60,000 pixels. The calculations obviously results in thousands of duplicates. Printing 32-bit pixels to the screen is extremely slow. As I understand it, the display adapter takes the time to match every pixel to those in its repertoire to make sure it is using the best choice. Everyone I know who studies fractals seriously writes the data to an external file and transfers the result to the screen to avoid this time delay. With this workaround I can plot over a couple of billion points in less than two minutes. If I wrote directly to the screen, this would take hours.

The end point of the work is not a bit map. This is a way of explaining what I need. I am trying to advance understand of the random dot process by which millions of randomly generated dots results in images of such order and beauty as manifest in Sierpinski polygons. I have in mind several avenues of exploration that will be facilitated if I can draw polygons on my screen buffer before I begin the iteration process. If you have expertise, please help me out here. I am hoping for simple answers to what I think is simple problem.

Regards, Sir Roland.

Thanks, Baccus. I pasted test0 into my code but Visual studio 2010 didn't accept inline although it did flag it as a reserve word. I installed the .h file called for in the snippet. I'm have never used inline. Is there a C language test that will do the job? Thanks again

Thanks for the comment. I have the coding to get the name. What I'm looking for is how to find if the file already exists.

Yes, that's what I mean.