R.G. Karlsson and M.H. Overmars, Normalized Divide and Conquer, to appear Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The P-range tree: A new data structure for range searching.. - Subramanian, al. (1995) (Correct)
....query q in O(IL (n) t) time where t denotes the number of points of P that belong to q. The data structure of Theorem 4.2 can be used to build a multidimensional range searching data structure for dimension three or more. By using a normalization technique due to Karlsson and Overmars [14, 25] we can reduce the general d dimensional range searching problem (with arbitrary coordinates) to one in which all the coordinates have value in the range [1: n] This reduction only adds a factor of d log n to the query time. Therefore, using the p range tree and the d dimensional range searching ....
R. G. Karlsson and M. H. Overmars, "Normalized Divide and Conquer," Department of Computer Science, University of Utrecht, Technical Report RUU-CS-86-18, 1986.
Scanline Algorithms on a Grid - Karlsson, Overmars (1986) (5 citations) Self-citation (Karlsson Overmars) (Correct)
....since there exist scanline algoritbmR for triangulation and construction of Voronoi diagram it would be interesting to see if the methods of this paper can be employed to make such solutions faster. In another paper, we have extended some of the results in this paper to higher dimensions [9]. 8. ....
R.G. Karlsson and M.H. Overmars, Normalized Divide and Conquer, to appear
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC