Computing half-plane and strip discrepancy of planar point sets

Citations of this article
Mendeley users who have this article in their library.


We present efficient algorithms for two problems concerning the discrepancy of a set S of n points in the unit square in the plane. First, we describe an algorithm for maintaining the half-plane discrepancy of S under insertions and deletions of points. The algorithm runs in O(n log n) worst-case time per update, and it requires only relatively simple data structures. Second, we give an algorithm that computes the strip discrepancy of S in O(n2α(n) log n) time, where α(n) is the extremely slowly growing functional inverse of Ackermann's function.




De Berg, M. (1996). Computing half-plane and strip discrepancy of planar point sets. Computational Geometry: Theory and Applications, 6(2), 69–83.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free