Showing papers by "Jiří Matoušek published in 1989"
05 Jun 1989
TL;DR: A set of points in the plane has to be stored in such a way that for any query triangle the number of points of A inside A inside t can be computed efficiently.
Abstract: A set A of n points in the plane has to be stored in such a way that for any query triangle t the number of points of A inside t can be computed efficiently. For this problem a solution is presented with O(√n log n) query time, O (n log n) space and O(n3/2 log n) preprocessing time. The constants in the asymptotic bounds are small, and the method is easy to implement.
25 citations
05 Jun 1989
22 citations
TL;DR: An algorithm satisfying the on-line restriction, which for every n computes the first n terms of the sequence c in time O(n log 2 n), using O( n) storage is presented.