Charla: Range Reporting for Points and Documents


Compartir
Charlista: 
Yakov Nekrich
Fecha: 
13 Junio, 2012 - 14:00
Sala: 
Auditorio DCC
Organización: 
DCC

 

Abstract:

 

In the orthogonal range reporting problem  a set of points S is stored in a data structure; for any query rectangle Q we should report all points p from S that are inside Q. This problem was studied extensively in  the data structures and computational  geometry communities.

 

In this talk I will overview some recent results related to the orthogonal range reporting problem. I will also describe their applications to document retrieval.