Dominance made simple

Authors:
Sanjeev Saxena
Affiliations:
Computer Science & Engineering, Indian Institute of Technology, Kanpur, India 208 016
Venue:
Information Processing Letters
Year:
2009

Citing 5
Cited 2

Efficient plane sweeping in parallel

SCG '86 Proceedings of the second annual symposium on Computational geometry
Parallel merge sort

SIAM Journal on Computing
Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values

Journal of Algorithms
Algorithms for three-dimensional dominance searching in linear space

Information Processing Letters
Triply-logarithmic parallel upper and lower bounds for minimum and range minima over small domains

Journal of Algorithms

On finding fundamental cut sets

Information Processing Letters
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays

SIAM Journal on Computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this note we show that it is extremely easy to answer dominance queries in three dimensions using only range minima routine (and a binary tree). The algorithm after preprocessing takes O(logn+S) time, where S is the size of output (after O(nlogn) time for pre-processing). The algorithm can also be used to answer 5-sided range queries, in same time bounds.