Real-time 3D rendering of heterogeneous scenes

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Petring, R., Eikel, B., Jähn, C., Fischer, M., & Meyer Auf Der Heide, F. (2013). Real-time 3D rendering of heterogeneous scenes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8033 LNCS, pp. 448–458). https://doi.org/10.1007/978-3-642-41914-0_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free