@book{68ff98aaa5dc4ab2a0d8d8367f780149,
title = "Generalized static orthogonal range searching in less space",
abstract = "We reduce the space usage on two problems related to generalized orthogonal range searching by almost a logarithmic factor. Our main result is that the generalized static orthogonal segment intersection reporting problem for n segment on an n times n grid can be solved in time O(log 2 log n + k) for queries using space O(n log log n). Here k is the number of reported segments.",
keywords = "orthogonal range searching, segment intersection reporting, space efficiency, algorithmic complexity, grid-based data structure",
author = "Mortensen, \{Christian Worm\}",
year = "2003",
month = sep,
language = "English",
series = "IT University Technical Report Series",
number = "TR-2003-33",
publisher = "IT-Universitetet i K{\o}benhavn",
address = "Denmark",
edition = "TR-2003-33",
}