Information

Abstract

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.

Additional Files and Images

Weblinks

No further information available.

BibTeX

@techreport{Wimmer-1998-SMO,
  title =      "Load Balancing for Smooth LODs",
  author =     "Michael Wimmer and Dieter Schmalstieg",
  year =       "1998",
  abstract =   "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.",
  month =      dec,
  number =     "TR-186-2-98-31",
  address =    "Favoritenstrasse 9-11/186, A-1040 Vienna, Austria",
  institution = "Institute of Computer Graphics and Algorithms, Vienna
               University of Technology",
  note =       "human contact: technical-report@cg.tuwien.ac.at",
  keywords =   "smooth LODs, level of detail, load balancing, virtual
               environments",
  URL =        "https://www.cg.tuwien.ac.at/research/publications/1998/Wimmer-1998-SMO/",
}