Category:Kinetic data structures
From Wikipedia, the free encyclopedia
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. This list may not reflect recent changes (learn more).
- Kinetic closest pair
- Kinetic convex hull
- Kinetic data structure
- Kinetic diameter (data)
- Kinetic Euclidean minimum spanning tree
- Kinetic hanger
- Kinetic heap
- Kinetic heater
- Kinetic minimum box
- Kinetic minimum spanning tree
- Kinetic priority queue
- Kinetic smallest enclosing disk
- Kinetic sorted list
- Kinetic tournament
- Kinetic triangulation
- Kinetic width