An O(n)-space O(log N= Log Log N + F )-query Time Algorithm for 3-d Dominance Reporting
نویسندگان
چکیده
We present a linear-space algorithm for handling the three-dimensional dominance reporting problem: given a set S of n three-dimensional points, design a data structure for S so that the points in S which dominate a given query point can be reported quickly. Under the variation of the RAM model introduced by Fredman and Willard 8], our algorithm achieves O(log n= loglog n + f) query time, where f is the number of points reported. Extensions to higher dimensions are also reported.
منابع مشابه
Fast Algorithms For 3-D Dominance Reporting And Counting
We present in this paper fast algorithms for the 3-D dominance reporting and counting problems, and generalize the results to the d-dimensional case. Our 3-D dominance reporting algorithm achieves O(log n= log log n + f) 1 query time using O(n log n) space , where f is the number of points satisfying the query and > 0 is an arbitrarily small constant. For the 3-D dominance counting problem (whi...
متن کاملSpace-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
We present linear-space sub-logarithmic algorithms for handling the 3-dimensional dominance reporting and the 2-dimensional dominance counting problems. Under the RAM model as described in [M. L. Fredman and D. E. Willard. “Surpassing the information theoretic bound with fusion trees”, Journal of Computer and System Sciences, 47:424– 436, 1993], our algorithms achieve O(log n/ log log n + f) qu...
متن کاملFast Algorithms for D Dominance Reporting and Counting
We present in this paper fast algorithms for the D dominance reporting and counting problems and generalize the results to the d dimensional case Our D dominance reporting algorithm achieves O log n log log n f query time using O n log n space where f is the number of points satisfying the query and is an arbitrarily small constant For the D dominance counting problem which is equivalent to the...
متن کاملSpace-eecient and Fast Algorithms for Multidimensional Dominance Reporting and Range Counting
We present linear space sublogarithmic algorithms for handling the three dimensional dominance reporting problem and the two dimensional range counting problem Under the RAM model as described in M L Fredman and D E Willard Surpassing the information theoretic bound with fusion trees Journal of Computer and System Sciences our algorithms achieve O logn log logn f query time for D dominance repo...
متن کاملFr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories
vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006