I'm working on a game concept and in order to be reasonably efficient I need to simplify same sized voxels into macro voxels. I'm willing to do my own research but I'm having trouble even finding the right keywords to query to even begin in finding what similar work has already been done.
So the general problem, or family of problems is the idea of being able to add or subtract squares such that the end result is the same as had every square been added independently.
For example, if you had a grid of.
You could define that as two squares. Adding one 2x2 over the whole area, and one subtracting. The long term goal is to achieve either optimal or a reasonably optimal representation, with large amounts of data, and 3d. But at this stage I'm willing to look at anything that is remotely similar.
I've been out of computer science for a long long time and might need a reminder or two to know where to start looking.
I'm definitely interested in anything related to 2d solutions as well because I'm just starting with this problem and am very open to starting at the beginning and 2d is likely the beginning. Surely I'm not the first person to need to optimize this.
For background I'm a web developer and unsurprising you can spend a lot of time not touching a most of computer science when doing that for a long time, so one gets rusty when they want to start reproaching the more mathematical and abstract side of optimization problems.
To know more about the even broader problem it is intended to be related to calculating fields (I'm trying to make a very nerdy game), and because fields can be superimposed, by reducing it into a lower count of elements it can be more calculable, especially if all large and small elements have similar geometries.