Star splaying is a general-dimension algorithm that takes … weighted Delaunay triangulation, or convex hull of the … sense quantified herein, and it is sparse (i.e., … in the number of vertices. Thus, star splaying … the Delaunay property after its vertices have moved … converting a triangulation to a Delaunay triangulation, but … [p. 239] the workhorse of star flipping is the … [dimensional] recursion. To make a star locally convex, star flipping tries … local convexity to a star does star flipping … [for the lower-dimensional topological structure]. … [p. 240] Unfortunately, both genericity and the use of … star splaying or star flipping. … [p. 245] Star splaying allows [multiple] processors to lock … lock two stars at a time.
Google-1
Google-2
Copyright clearance needed for quotation.