Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization


In a generalized intersection searching problem, a set, S, of colored geometrie objects is to be preprocessed so that given some query object, q, the distinct colors of the objects intersected by q can be reported efficiently or the number of such colors can be counted effi.ciently. In the dynamic setting, colored objects can be inserted into or de1eted… (More)
DOI: 10.1007/3-540-57155-8_262