Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

http://www.elsevier.com/locate/jcss Journal of Computer and System Sciences 66 (2003) 207243

Summary: http://www.elsevier.com/locate/jcss
Journal of Computer and System Sciences 66 (2003) 207243
Indexing Moving Points$
Pankaj K. Agarwal,a,
Lars Arge,a,2
and Jeff Ericksonb,3
Center for Geometric Computing, Department of Computer Science, Duke University, Durham, NC 27708, USA
Department of Computer Science, University of Illinois, Urbana, IL 61801, USA
Received 13 December 2000; revised 6 February 2002
We propose three indexing schemes for storing a set S of N points in the plane, each moving along a
linear trajectory, so that any query of the following form can be answered quickly: Given a rectangle R and
a real value t; report all K points of S that lie inside R at time t: We first present an indexing structure that,
for any given constant e > 0; uses ON=B disk blocks and answers a query in ON=B1=2e
K=B I/Os,
where B is the block size. It can also report all the points of S that lie inside R during a given time interval.
A point can be inserted or deleted, or the trajectory of a point can be changed, in Olog2


Source: Arge, Lars - Department of Computer Science, Aarhus Universitet


Collections: Computer Technologies and Information Sciences