Kinetic smallest enclosing disk: Difference between revisions

Content deleted Content added
m clean up using AWB
Dthomsen8 (talk | contribs)
Reviewed by Dthomsen8
Line 1:
{{Userspace draft|source=ArticleWizard|date=May 2012}} <!-- Please leave this line alone! -->
 
A '''kinetic smallest enclosing disk''' data structure is a [[kinetic data structure]] that maintains the [[Smallest circle problem|smallest enclosing disk]] of a set of moving points.