Abstract | ||
---|---|---|
Many virtual 3D scenes, especially those that are large, are not structured evenly. For such heterogeneous data, there is no single algorithm that is able to render every scene type at each position fast and with the same high image quality. For a small set of scenes, this situation can be improved if different rendering algorithms are manually assigned to particular parts of the scene by an experienced user. We introduce the Multi-Algorithm-Rendering method. It automatically deploys different rendering algorithms simultaneously for a broad range of scene types. The method divides the scene into subregions and measures the behavior of different algorithms for each region in a preprocessing step. During runtime, this data is utilized to compute an estimate for the quality and running time of the available rendering algorithms from the observer's point of view. By solving an optimizing problem, the image quality can be optimized by an assignment of algorithms to regions while keeping the frame rate almost constant. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1007/978-3-642-41914-0_44 | ADVANCES IN VISUAL COMPUTING, ISVC 2013, PT I |
DocType | Volume | ISSN |
Conference | 8033 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ralf Petring | 1 | 0 | 0.68 |
Benjamin Eikel | 2 | 2 | 1.39 |
Claudius Jähn | 3 | 10 | 3.95 |
Matthias Fischer | 4 | 0 | 0.34 |
Friedhelm Meyer auf der Heide | 5 | 1744 | 238.01 |