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.
[1] Carlo H. Séquin,et al. Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments , 1993, SIGGRAPH.
[2] Dieter Schmalstieg,et al. Smooth levels of detail , 1997, Proceedings of IEEE 1997 Annual International Symposium on Virtual Reality.