Kinetic tournament

A Kinetic Tournament is a kinetic data structure that functions as a priority queue for elements whose priorities change as a continuous function of… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Lang's "universal molecule" algorithm solves a variant of the origami design problem. It takes as input a metric tree and a… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 6
Is this relevant?
2006
2006
We study the problem of designing kinetic data structures (KDS’s for short) when event times cannot be computed exactly and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?