Category:Kinetic data structures
 | Computing portal |
Here is a list of articles in the Kinetic data structures category of the Computing portal that unifies foundations of mathematics and computations using computers. A kinetic data structure is a data structure used to track an attribute of a geometric system that is moving continuously.
Pages in category "Kinetic data structures"
The following 16 pages are in this category, out of 16 total.
K
- Kinetic closest pair (computing)
- Kinetic convex hull (computing)
- Kinetic data structure (computing)
- Kinetic diameter (data) (computing)
- Kinetic Euclidean minimum spanning tree (computing)
- Kinetic hanger (computing)
- Kinetic heap (computing)
- Kinetic heater (computing)
- Kinetic minimum box (computing)
- Kinetic minimum spanning tree (computing)
- Kinetic priority queue (computing)
- Kinetic smallest enclosing disk (computing)
- Kinetic sorted list (computing)
- Kinetic tournament (computing)
- Kinetic triangulation (computing)
- Kinetic width (computing)
Mathematics
Organizations
Books
About