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.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of computer mathematics Jg. 13; H. 3-4; S. 221 - 229
1. Verfasser:	Edelsbrunner, Herbert
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Gordon and Breach Science Publishers 01.01.1983
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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