Adaptive Mesh Approach for Predicting Algorithm Behavior with Application to Visibility Culling in Computer Graphics

Simple item page
dc.creatorFischer, Matthias
dc.creatorJähn, Claudius
dc.creatorZiegler, Martin
dc.date2009-03-12
dc.date.accessioned2026-07-07T12:51:52Z
dc.date.available2026-07-07T12:51:52Z
dc.descriptionWe propose a concise approximate description, and a method for efficiently obtaining this description, via adaptive random sampling of the performance (running time, memory consumption, or any other profileable numerical quantity) of a given algorithm on some low-dimensional rectangular grid of inputs. The formal correctness is proven under reasonable assumptions on the algorithm under consideration; and the approach's practical benefit is demonstrated by predicting for which observer positions and viewing directions an occlusion culling algorithm yields a net performance benefit or loss compared to a simple brute force renderer.
dc.identifierhttps://arxiv.org/abs/0903.2119
dc.identifierhttp://arxiv.org/abs/0903.2119
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/223126
dc.subjectPerformance
dc.subjectGraphics
dc.subjectC.4; I.3
dc.titleAdaptive Mesh Approach for Predicting Algorithm Behavior with Application to Visibility Culling in Computer Graphics
dc.typetext

Files

Collections

arXiv