Walkthrough Quadtree

Question

I am trying to implement a forward iterator for a quadrant. Unfortunately, I don't seem to be able to find any resource about rounds in the quadrant.

Can someone point me in the right direction?

Answer 1

A simple way is to linearize the tree. Of course, you will have to do this recursively, but you will create an array of pointers to the nodes you want to visit, and then create an advanced iterator from it.

Answer 2

Take the gander on the next paper and see if you have what you need ...

Simple and efficient trace methods for quatrains and octets

Answer 3

This is my javascript implementation: https://github.com/alexroat/quadtree-traversal

There is a visual demonstration demonstrating the behavior of the algorithm.