Kinetic data structures
Topic: Category
From HandWiki - Reading time: 1 min
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
- 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
Licensed under CC BY-SA 3.0 | Source: https://handwiki.org/wiki/Category:Kinetic_data_structures9 views | ↧ Download this article as ZWI file
EncycloReader
is supported by the 
KSF