Currently, count histogram binning works in a greedy way: it merges tiles until 1) the total count is bellow a threshold, 2) minimum order (default is 0) is reached. I believe we can do it smarter and do not merge it further if all tiles but one have zero counts.
It may produce too many partitions for some edge-cases, e.g. very clumpy data in a catalog composed from many individual pointings. However these edge-cases can be solved with a smaller maximum order.
Before submitting
Please check the following:
[x] I have described the purpose of the suggested change, specifying what I need the enhancement to accomplish, i.e. what problem it solves.
[ ] I have included any relevant links, screenshots, environment information, and data relevant to implementing the requested feature, as well as pseudocode for how I want to access the new functionality.
[ ] If I have ideas for how the new feature could be implemented, I have provided explanations and/or pseudocode and/or task lists for the steps.
Feature request
Currently, count histogram binning works in a greedy way: it merges tiles until 1) the total count is bellow a threshold, 2) minimum order (default is 0) is reached. I believe we can do it smarter and do not merge it further if all tiles but one have zero counts.
It may produce too many partitions for some edge-cases, e.g. very clumpy data in a catalog composed from many individual pointings. However these edge-cases can be solved with a smaller maximum order.
Before submitting Please check the following: