Rectangle enclosure reporting in linear space revisited

Authors:
George Lagogiannis;Christos Makris;Yannis Panagis;Spyros Sioutas;Kostas Tsichlas
Affiliations:
Computer Engineering and Informatics Department, University of Patras, Patras, Greece;Computer Engineering and Informatics Department, University of Patras, Patras, Greece;Computer Engineering and Informatics Department, University of Patras, Patras, Greece;Computer Engineering and Informatics Department, University of Patras, Patras, Greece;Computer Engineering and Informatics Department, University of Patras, Patras, Greece
Venue:
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Year:
2003

Citing 5
Cited 0

Filtering search: a new approach to query answering

SIAM Journal on Computing
Normalized divide-and-conquer: a scaling technique for solving multi-dimensional problems

Information Processing Letters
The rectangle enclosure and point-dominance problems revisited

Proceedings of the eleventh annual symposium on Computational geometry
The space-optimal version of a known rectangle enclosure reporting algorithm

Information Processing Letters
A new algorithm for rectangle enclosure reporting

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new algorithm for reporting all the enclosures in a set of plane rectangles in O(n log n log log n + k log log n) time and linear space (k denotes the output size). The result is already known (it has already been achieved by two previous papers), however the proposed algorithm follows a different approach.