You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently, the pixel tree uses individual python objects for its nodes. For larger trees, this means it performs pretty slowly. By changing the tree structure to instead use a simpler object like a tuple, this could improve performance. This would mean a slight change to the pixel tree interface, but given that most of our interactions with the tree come from performing a pixel alignment and working with that, I don't think this will require big changes across the code base.
Alternatively, the tree could be written in something like C or Rust and wrapped for the best performance.
The text was updated successfully, but these errors were encountered:
Currently, the pixel tree uses individual python objects for its nodes. For larger trees, this means it performs pretty slowly. By changing the tree structure to instead use a simpler object like a tuple, this could improve performance. This would mean a slight change to the pixel tree interface, but given that most of our interactions with the tree come from performing a pixel alignment and working with that, I don't think this will require big changes across the code base.
Alternatively, the tree could be written in something like C or Rust and wrapped for the best performance.
The text was updated successfully, but these errors were encountered: