Load Balancing for Smooth LODs

The paper shows how to derive an analytic formula for the following problem: given a set of objects in a continuous level of detail representation, and given a total number of polygons to display, determine the number of polygons to use for each object so that the best overall appearance is achieved. This improves on the situation of discrete levels of detail, where the problem has been shown to be equivalent to a constrained knapsack-problem.