English Range query (data structures) Cited by user Madaniamirali on 20 Dec 2021 In data structures, a range query consists of preprocessing some input data into a data structure to efficiently answer any number of queries on any subset of the input.
English Kinetic Euclidean minimum spanning tree Cited by user Rjwilmsi on 15 Jun 2016 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…