<s>
A	O
kinetic	B-Data_Structure
sorted	I-Data_Structure
list	I-Data_Structure
is	O
a	O
kinetic	B-Data_Structure
data	I-Data_Structure
structure	I-Data_Structure
for	O
maintaining	O
a	O
list	O
of	O
points	O
under	O
motion	O
in	O
sorted	O
order	O
.	O
</s>
<s>
It	O
is	O
used	O
as	O
a	O
kinetic	B-Data_Structure
predecessor	I-Data_Structure
data	O
structure	O
,	O
and	O
as	O
a	O
component	O
in	O
more	O
complex	O
kinetic	B-Data_Structure
data	I-Data_Structure
structures	I-Data_Structure
such	O
as	O
kinetic	B-Data_Structure
closest	I-Data_Structure
pair	I-Data_Structure
.	O
</s>
<s>
This	O
kinetic	B-Data_Structure
data	I-Data_Structure
structure	I-Data_Structure
is	O
:	O
</s>
<s>
This	O
data	O
structure	O
can	O
be	O
generalized	O
to	O
a	O
kinetic	B-Data_Structure
data	I-Data_Structure
structure	I-Data_Structure
which	O
can	O
return	O
a	O
sorted	O
list	O
of	O
points	O
in	O
time	O
and	O
processes	O
events	O
total	O
,	O
assuming	O
pseudo	O
algebraic	O
trajectories	O
,	O
where	O
is	O
a	O
parameter	O
of	O
the	O
data	O
structure	O
.	O
</s>
<s>
In	O
the	O
generalized	O
data	O
structure	O
,	O
the	O
points	O
are	O
partitioned	O
arbitrarily	O
into	O
m	O
subsets	O
of	O
size	O
,	O
and	O
kinetic	B-Data_Structure
sorted	I-Data_Structure
lists	I-Data_Structure
are	O
maintained	O
on	O
the	O
subsets	O
.	O
</s>
<s>
Requests	O
for	O
the	O
sorted	O
list	O
can	O
then	O
be	O
answered	O
in	O
by	O
merging	O
the	O
sorted	O
sublists	O
with	O
mergesort	B-Algorithm
.	O
</s>
