Browsing 31-Issue 5 by Subject "F.2.2 [Analysis of Algorithms and Problem Complexity]"

Now showing items 1-1 of 1

    • New Bounds on the Size of Optimal Meshes 

      Sheehy, Donald R. (The Eurographics Association and Blackwell Publishing Ltd., 2012)
      The theory of optimal size meshes gives a method for analyzing the output size (number of simplices) of a Delaunay refinement mesh in terms of the integral of a sizing function over the input domain. The input points define ...