A kinetic data structure is a data structure used to track an attribute of a geometric system that is moving continuously. For example, a kinetic convex...

A kinetic diameter data structure is a kinetic data structure which maintains the diameter of a set of moving points. The diameter of a set of moving...

A kinetic width data structure is a kinetic data structure which maintains the width of a set of moving points. In 2D, the width of a point set is the...

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...

A kinetic smallest enclosing disk data structure is a kinetic data structure that maintains the smallest enclosing disk of a set of moving points. In 2...

A Kinetic Heap is a kinetic data structure, obtained by the kinetization of a heap. It is designed to store elements (keys associated with priorities)...

A kinetic triangulation data structure is a kinetic data structure that maintains a triangulation of a set of moving points. Maintaining a kinetic triangulation...

A kinetic convex hull data structure is a kinetic data structure that maintains the convex hull of a set of continuously moving points. It should be distinguished...

A kinetic closest pair data structure is a kinetic data structure that maintains the closest pair of points, given a set P of n points that are moving...

(which changes as a continuous function of time as in all kinetic data structures). The kinetic heater is then simultaneously a binary search tree on the...

A Kinetic Tournament is a kinetic data structure that functions as a priority queue for elements whose priorities change as a continuous function of time...

A kinetic minimum spanning tree is a kinetic data structure that maintains the minimum spanning tree (MST) of a graph whose edge weights are changing...

A kinetic sorted list is a kinetic data structure for maintaining a list of points under motion in sorted order. It is used as a kinetic predecessor data...

Kinetic minimum box is a kinetic data structure to maintain the minimum bounding box of a set of points whose positions change continuously with time...

A Kinetic Priority Queue is an abstract kinetic data structure. It is a variant of a priority queue designed to maintain the maximum (or minimum) priority...

geometric proximity graph, which was first described to present a kinetic data structure for maintenance of all the nearest neighbors on moving objects....

 354–362. Tangwongsan, Kanat (5 May 2006). Active Data Structures and Applications to Dynamic and Kinetic Algorithms (PDF) (Thesis).  This article incorporates...

deletion of its edges are allowed. Dynamization Dynamic connectivity Kinetic data structure D. Eppstein, Z. Galil, and G. F. Italiano. "Dynamic graph algorithms"...

Thermodynamic reaction control or kinetic reaction control in a chemical reaction can decide the composition in a reaction product mixture when competing...

factor of two in polynomial time. The kinetic Euclidean minimum spanning tree problem asks for a kinetic data structure that can maintain the minimum spanning...

structures on its elements. The kinetic hanger structure (including certificates and event queue) is exactly the same as the kinetic heap structure,...

In visual perception, the kinetic depth effect is the phenomenon whereby the three-dimensional structural form of an object can be perceived when the...

Urey–Bigeleisen–Mayer equation Westaway KC (2006). "Using kinetic isotope effects to determine the structure of the transition states of SN2 reactions". Advances...

Geometry processing Search structures (k-d tree) Shape analysis, fitting, and distances Interpolation Kinetic data structures The library is supported on...

subdivided into static friction ("stiction") between non-moving surfaces, and kinetic friction between moving surfaces. With the exception of atomic or molecular...

Kinetic art is art from any medium that contains movement perceivable by the viewer or that depends on motion for its effects. Canvas paintings that extend...

optimal data structure for point location, the quad-edge data structure for representing planar subdivisions, Metropolis light transport, and kinetic data structures...

triangle to triangle until the query ray hits the polygon boundary. Kinetic data structures, proposed by Leonidas Guibas, Julien Basch and Hershberger, have...

Observation 1, p. 2. Rahmati, Z.; King, V.; Whitesides, S. (2013). Kinetic data structures for all nearest neighbors and closest pair in the plane. Proceedings...

Korea Data Systems, a defunct South Korean monitor manufacturer Khalsa Diwan Society Vancouver, a Canadian Sikh religious organization Kinetic data structure...