The study begun in Part I is completed by providing an algorithm which reports all intersecting pairs of a set of rectangles in d dimensions. This approach yields a solution which is optimal in time and space for planar rectangles and reasonable in higher dimensions.
No takes yet. Share an insight, caveat, or question.
Herbert Edelsbrunner (1983) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: