<s>
A	O
kinetic	B-Data_Structure
Euclidean	I-Data_Structure
minimum	I-Data_Structure
spanning	I-Data_Structure
tree	I-Data_Structure
is	O
a	O
kinetic	B-Data_Structure
data	I-Data_Structure
structure	I-Data_Structure
that	O
maintains	O
the	O
Euclidean	O
minimum	O
spanning	O
tree	O
(	O
EMST	O
)	O
of	O
a	O
set	O
P	O
of	O
n	O
points	O
that	O
are	O
moving	O
continuously	O
.	O
</s>
<s>
Rahmati	O
and	O
Zarei	O
build	O
a	O
kinetic	B-Data_Structure
data	I-Data_Structure
structure	I-Data_Structure
based	O
on	O
the	O
kinetic	O
Delaunay	O
triangulation	O
to	O
handle	O
updates	O
to	O
the	O
EMST	O
in	O
polylog	O
time	O
per	O
event	O
.	O
</s>
<s>
Their	O
kinetic	B-Data_Structure
data	I-Data_Structure
structure	I-Data_Structure
handles	O
events	O
,	O
where	O
m	O
is	O
the	O
number	O
of	O
all	O
changes	O
to	O
the	O
Delaunay	O
triangulation	O
of	O
the	O
moving	O
points	O
.	O
</s>
<s>
Their	O
kinetic	B-Data_Structure
data	I-Data_Structure
structure	I-Data_Structure
handles	O
a	O
nearly	O
cubic	O
number	O
of	O
events	O
.	O
</s>
