The Configuration Space Framework

@inproceedings{TheCS,
  title={The Configuration Space Framework},
  author={}
}
    In Section 7.1, we have discussed the incremental construction of the Delaunay trian-gulation of a finite point set. In this lecture, we want to analyze the runtime of this algorithm if the insertion order is chosen uniformly at random among all insertion orders. We will do the analysis not directly for the problem of constructing the Delaunay triangulation but in a somewhat more abstract framework, with the goal of reusing the analysis for other problems. Throughout this lecture, we again… CONTINUE READING

    Similar Papers