0

I've read about a quadtree or kd-tree splitting and a mandelbrot set but what when the rectangle before the first split and the frame lies in the mandelbrot set or has the same iteration depth and the algorithm returns from tiling? How can I force to skip filling a rectangle when it's too big?

mkj
  • 2,761
  • 5
  • 24
  • 28
Micromega
  • 12,486
  • 7
  • 35
  • 72

0 Answers0