Revision as of 18:48, 19 May 2012 edit Ringwith (talk \| contribs) 333 edits No edit summary ← Previous edit		Revision as of 18:48, 19 May 2012 edit undo Ringwith (talk \| contribs) 333 edits →2D Next edit →
Line 3: 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. == 2D == In 2 dimensions, the best known kinetic smallest enclosing disk data structure uses farthest point delaunay triangulation of the point set to maintain the kinetic <ref name="DEGS10"><\/ref>. The farthest-point delaunay triangulation is the [[dual_(Projective Geometry)]] of the [[Voronoi diagram#Higher-order Voronoi diagrams#Farthest-point Voronoi diagram\|farthest-point Voronoi diagram]]. The

Kinetic smallest enclosing disk: Difference between revisions