Visibility based prefetching with simulated annealing

Çevikbaş, Şafak Burak
Complex urban scene rendering is not feasible without culling invisible geometry before the rendering actually takes place. Visibility culling can be performed on predefined regions of scene where for each region a potential visible set of scene geometry is computed. Rendering cost is reduced since instead of a bigger set only a single PVS which is associated with the region of the viewer is rendered. However, when the viewer leaves a region and enters one of its neighbors, disposing currently loaded PVS and loading the new PVS causes stalls. Prefetching policies are utilized to overcome stalls by loading PVS of a region before the viewer enters it. This study presents a prefetching method for interactive urban walkthroughs. Regions and transitions among them are represented as a graph where the regions are the nodes and transitions are the edges. Groups of nodes are formed according to statistical data of transitions and used as the prefetching policy. Some heuristics for constructing groups of nodes are developed and Simulated Annealing is utilized for constructing optimized groups based on developed heuristics. The proposed method and underlying application of Simulated Annealing are customized for minimizing average transition cost.


Interactive editing of complex terrains on parallel graphics architectures
Gün, Ufuk; İşler, Veysi; Department of Computer Engineering (2009)
Rendering large terrains on large screens at interactive frame rates is a challenging area of computer graphics. In the last decade, real-time terrain rendering on large screens played a significant role in various simulations and virtual reality systems. To fulfill the demand of these systems, two software tools are developed. The first tool is a Terrain Editor that creates and manipulates large terrains. The second is a Multi-Display Viewer that displays the created terrains on multiple screens. Since the...
Task parallelism for ray tracing on a gpu cluster
Ünlü, Çağlar; İşler, Veysi; Department of Computer Engineering (2008)
Ray tracing is a computationally complex global illumination algorithm that is used for producing realistic images. In addition to parallel implementations on commodity PC clusters, recently, Graphics Processing Units (GPU) have also been used to accelerate ray tracing. In this thesis, ray tracing is accelerated on a GPU cluster where the viewing plane is divided into unit tiles. Slave processes work on these tiles in a task parallel manner which are dynamically assigned to them. To decrease the number of r...
AKTIHANOGLU, M; OZGUC, B; AYKANAT, C (Springer Science and Business Media LLC, 1994-01-01)
This paper describes a system for modeling, animating, previewing and rendering articulated objects. The system has a modeler of objects that consists of joints and segments. The animator interactively positions the articulated object in its stick, control vertex, or rectangular prism representation and previews the motion in real time. Then the data representing the motion and the models is sent to a multicomputer [iPSC/2 Hypercube (Intel)]. The frames are rendered in parallel, exploiting the coherence bet...
A study on conceptual modeling in simulation systems : an extended methodology for KAMA
Aysolmaz Bozlu, Banu E; Demirörs, Onur; Department of Information Systems (2007)
Conceptual modeling is considered to be essential in simulation development activities. However, there are only a few research studies on how to develop conceptual models. One of the important and comprehensive approaches is the methodology developed under the leadership of METU Modeling and Simulation Center (MODSIMMER) for Turkish Armed Forces. The project suggests a methodology to develop mission space conceptual models (GUKAM), and provides a Conceptual Model Development Tool for C4ISR M&S activities, w...
Assignment problem and its variations
Gülek, Mehmet; Toroslu, İsmail Hakkı; Department of Computer Engineering (2007)
We investigate the assignment problem, which is the problem of matching two sets with each other, optimizing a given function on the possible matchings. Among different definitions, a graph theoretical definition of the linear sum assignment problem is as follows: Given a weighted complete bipartite graph, find a maximum (or minimum) one-to-one matching between the two equal-size sets of the graph, where the score of a matching is the total weight of the matched edges. We investigate extensions and variatio...
Citation Formats
Ş. B. Çevikbaş, “Visibility based prefetching with simulated annealing,” M.S. - Master of Science, Middle East Technical University, 2008.