In KTChannelAggregator, the points on which the DBF is evaluated forms a fixed, rectangular grid.
One question we were interested in was to find the maximum of the DBF, to the extent that the error in the position reconstruction is limited by noise. Of course, one could just use finer and finer grids to estimate the maximum, but this is going to be inefficient. Although, its not under the scope of this request, I can imagine a maximizer function, finding a region at which the DBF is large, and calling the ChannelAggregator with a finer mesh in that localized area, without redoing the entire transverse plane.
The request is this: I was wondering if we could generalize the rectangular grids to arbitrary arrays of points, so some other processor can do this search in the future. I think this entails a) defining a data structure like vector<pair> for the nonuniform "grid" (+ interface to it) b) adjusting the loops accordingly. The data structure should default to a uniform grid. I also think it will make the code a bit cleaner.
In KTChannelAggregator, the points on which the DBF is evaluated forms a fixed, rectangular grid. One question we were interested in was to find the maximum of the DBF, to the extent that the error in the position reconstruction is limited by noise. Of course, one could just use finer and finer grids to estimate the maximum, but this is going to be inefficient. Although, its not under the scope of this request, I can imagine a maximizer function, finding a region at which the DBF is large, and calling the ChannelAggregator with a finer mesh in that localized area, without redoing the entire transverse plane.
The request is this: I was wondering if we could generalize the rectangular grids to arbitrary arrays of points, so some other processor can do this search in the future. I think this entails a) defining a data structure like
vector<pair>
for the nonuniform "grid" (+ interface to it) b) adjusting the loops accordingly. The data structure should default to a uniform grid. I also think it will make the code a bit cleaner.