Kinetic Euclidean minimum spanning tree
id:
kinetic-euclidean-minimum-spanning-tree-236-7442277
title:
Kinetic Euclidean minimum spanning tree
text:
A kinetic Euclidean minimum spanning tree is a kinetic data structure that maintains the Euclidean minimum spanning tree (EMST) of a set P of n points that are moving continuously. For the set of points P in 2-dimensional space, there are two kinetic algorithms for maintenance of the EMST. Rahmati and Zarei build a kinetic data structure based on the kinetic Delaunay triangulation to handle updates to the EMST in polylog time per event. Their kinetic data structure handles O events, where m is t
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Kinetic_Euclidean_minimum_spanning_tree
date created:
date modified:
2023-07-23T00:37:11Z
main entity:
{"identifier":"Q6410745","url":"https://www.wikidata.org/entity/Q6410745"}
image:
fields total:
13
integrity:
13