Automatic Hierarchical Level of Detail Optimization in Computer Animation

dc.contributor.authorMason, Ashton E.W.en_US
dc.contributor.authorBlake, Edwin H.en_US
dc.date.accessioned2015-02-15T18:05:21Z
dc.date.available2015-02-15T18:05:21Z
dc.date.issued1997en_US
dc.description.abstractWe show that the hierarchical level of detail optimization problem is equivalent to a constrained version of the Multiple Choice Knapsack Problem, and present a new algorithm whose solution to it is at least half as good as the optimal one. The advantage of the hierarchical algorithm is that it allows the use of hierarchical level of detail descriptions in which shared representations may be provided for groups of objects. Rendering cost may then be saved to afford better renderings of more important objects, and the algorithm is capable of providing a complete representation of the visible scene even when the visible scene complexity is very high. Our algorithm has a worst case time complexity of O(nlogn), and is incremental so that it typically completes in only a few iterations. We introduce the use of perceptual evaluation to demonstrate the effectiveness of the use of representations for groups of objects that our algorithm allows.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume16en_US
dc.identifier.doi10.1111/1467-8659.00156en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pagesC191-C199en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.00156en_US
dc.publisherBlackwell Publishers Ltd and the Eurographics Associationen_US
dc.titleAutomatic Hierarchical Level of Detail Optimization in Computer Animationen_US
Files
Collections