Filter Forge - FF4.0 Beta 2: Loops and Recursions!

Active Topics Search

CFandM ForgeSmith Posts: 4761 Filters: 266	Looks like the Sea Fairing DMV and everyones waiting for a License.. Very Stupid things happen to computers for stupid reasons at stupid times!
	Posted: March 25, 2013 10:12 am	Details E-Mail
Betis The Blacksmith Posts: 1207 Filters: 76	I think I got iterations to work as well as mandelbrot (as opposed to julia) (hopefully I'm not too late and can actually contribute? lol) I once wrote a fun program to sample the Buddhabrot, think it's possible in FF? Mandelbrot.ffxml Roses are #FF0000 Violets are #0000FF All my base are belong to you.
	Posted: March 25, 2013 11:35 pm	Details E-Mail
Skybase 2D/3D Generalist Posts: 4025 Filters: 76	Ohhh hohoho that's sweet stuff. Love your fake mod script.
	Posted: March 25, 2013 11:41 pm	Details E-Mail
Betis The Blacksmith Posts: 1207 Filters: 76	Thanks! I was surprised I didn't see it in the FF math library I'm not sure what's causing the bubble at the bottom... I would think it would be reflected in the top because of the symmetry of the equation, but it's not... Oh just had a good idea to save a LOT of processing time (hopefully): just render the top half and mirror to the bottom half. Or is it because of FF's nature that it's going to need to calculate just as many samples anyway? Roses are #FF0000 Violets are #0000FF All my base are belong to you.
	Posted: March 25, 2013 11:47 pm	Details E-Mail
Betis The Blacksmith Posts: 1207 Filters: 76	Also trying to script a Buddhabrot (http://en.wikipedia.org/wiki/Buddhabrot) It can't even render at 30x30 pixels Maybe I'm not doing it right, but I don't think this can be done natively. Essentially I need to take random imaginary numbers and feed them through the mandelbrot function and trace them as they go through, creating a probability map for orbits. Bright areas represent number clusters that many numbers go though during their journey through the function before either escaping or orbiting. What this means script-wise is that I need to take every pixel, check the whole pixel array, and check to see if the sample is at (or near) the pixel doing the calculation. I'm using a random noise function to generate my samples, which get calculated by the mandelbrot function. essentially every time you put in a number, you get another number, and I have to do the calculation at each iteration for each sample. I know I'm kind of over-explaining this but I hope one part or another makes sense. Anyone else up for the challenge? Buddhabrot.ffxml Roses are #FF0000 Violets are #0000FF All my base are belong to you.
	Posted: March 26, 2013 1:21 am	Details E-Mail
Sphinx. Filter Optimizer Posts: 1750 Filters: 39	Nice tweak Betis! Like you suspect there is no way to only render one half only in pure procedural rendering (the sample cache only works if the immediately following sampling is with the same coordinates, and there would be in between sampling before you reach e.g. the lower half). You might though be able to use a bitmap buffer after the loop component and flip-combine that. Njyldgarkn init/prepare process x no. of render blocks x no. of passes
	Posted: March 26, 2013 2:33 am	Details E-Mail
Skybase 2D/3D Generalist Posts: 4025 Filters: 76	My god Betis. That's gonna be a crazy render.
	Posted: March 26, 2013 3:46 am	Details E-Mail