A new approach to rectangle intersections Part II

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.

Uloženo v:

Podrobná bibliografie
Vydáno v:	International journal of computer mathematics Ročník 13; číslo 3-4; s. 221 - 229
Hlavní autor:	Edelsbrunner, Herbert
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Gordon and Breach Science Publishers 01.01.1983
Témata:	Computational geometry concrete complexity data structure E.1. [Data]: Data structures-trees F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical algorithms and problems-geometrical problems and computation, sorting and searching H.3.3 [Information Storage and Retrieval]: Information search and retrieval-search process intersection rectilinearly-oriented rectangle searching problem
ISSN:	0020-7160, 1029-0265
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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.
ISSN:	0020-7160 1029-0265
DOI:	10.1080/00207168308803365