Revision as of 19:45, 19 May 2012 edit Ringwith (talk \| contribs) 333 edits →2D ← Previous edit		Revision as of 19:45, 19 May 2012 edit undo Ringwith (talk \| contribs) 333 edits →Approximate 2D Next edit →
Line 12: == Approximate 2D == The smallest enclosing disk of a set of n moving points can be [[Approximation_algorithm#Epsilon_terms\|ε-approximated]] by a kinetic data structure that ~~process~~processes <math>O(1/\epsilon^{5/2})</math> events and requires <math>O((n/\sqrt{\epsilon})\log n)</math> time total.<ref name="AH01"></ref> == Higher dimensions ==

Kinetic smallest enclosing disk: Difference between revisions