Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  adapt the distribution seping method to the cache oblivious model. Distribution seping is the name used for a general approach for divide-and-conquer algorithms where the combination of solved subproblems can be vied as a merging process of streams.  demonstrate by a series of algorithms for specific problems the feasibility of the method in a cache oblivious setting. The problems all come from computational geometry, and are: orthogonal line segment intersection reporting, the all nearest neighbors problem, the 3D maxima problem, computing the measure of a set of axis-parallel rectangles, computing the visibility of a set of line segments from a point, batched orthogonal range queries, and reporting pairwise intersections of axis-parallel rectangles. Our basic building block is a simplified version of the cache oblivious sorting algorithm Funnelsort of Frigo et al., which is of independent interest.     Full text: http://dx.doi.org/10.1007/3-540-45465-9_37
['Gerth Stølting Brodal', 'Rolf Fagerberg']
I am writing a research paper on a idea Cache Oblivious Distribution Sweeping
[{"from": "human", "value": "I am writing a research paper on a idea Cache Oblivious Distribution Sweeping"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  adapt the distribution seping method to the cache oblivious model. Distribution seping is the name used for a general approach for divide-and-conquer algorithms where the combination of solved subproblems can be vied as a merging process of streams.  demonstrate by a series of algorithms for specific problems the feasibility of the method in a cache oblivious setting. The problems all come from computational geometry, and are: orthogonal line segment intersection reporting, the all nearest neighbors problem, the 3D maxima problem, computing the measure of a set of axis-parallel rectangles, computing the visibility of a set of line segments from a point, batched orthogonal range queries, and reporting pairwise intersections of axis-parallel rectangles. Our basic building block is a simplified version of the cache oblivious sorting algorithm Funnelsort of Frigo et al., which is of independent interest.  \u00a0  Full text: http://dx.doi.org/10.1007/3-540-45465-9_37"}]