In the paper, a new method for modelling trees at medium detail is presented. The method is based on a volumetric representation of trees, generated by an iterated function system (IFS). Alleviating the modeling restrictions of fractal techniques, extensions to the standard IFS are introduced. Practical aspects of modeling and rendering of trees, such as data structures and bounding volumes, ar...

The language-gap, for example between lowliteracy laypersons and highly-technical expert documents, is a fundamental barrier for cross-domain knowledge transfer. This paper seeks to close the gap at the thematic level via topic adaptation, i.e., adjusting the topical structures for cross-domain documents according to a domain factor such as technicality. We present a probabilistic model for thi...

Methods for computing tight bounding volumes for general parametric surfaces, for testing if two bounding volumes intersect and for computing inclusions for the intersection of two bounding volumes are discussed. These methods together with interval arithmetic are the basis for a robust algorithm for computing inclusions for all parts of the intersection curve of two general parametric surfaces.

We present a scheme and a data structure that decomposes the space into adaptive-sized cells to improve the visualization of soft objects. Soft objects are visualized through the evaluation of field functions at every point of the space. According to the proposed scheme, the affecting soft objects for a point in the space is searched through the data structure called an interval tree based on t...

We investigate the dynamics of phase separation in two-component fluid membranes confined between parallel and rigid bounding plates. Through numerical simulation, we find dramatic slow coarsening of the order parameter field within the simulation time. In particular, a microphase separation is obtained as an equilibrium phase for sufficiently large values of the elastic coupling, being consist...

Aim: To determine the frequency of dyslipidemia in patients of liver cirrhosis and the mean lipid profile in patients of liver cirrhosis. Methods: This cross sectional study was conducted at Department of Medicine, BVH, Bahawalpur from January 2013 to June 2013. In this study, 171 patients with cirrhosis of liver were included. Results and Conclusion: Out of 171 cirrhotic patients, dyslipidemia...

This paper introduces a new interconnection network topology called Balanced Varietal Hypercube (BVH), suitable for massively parallel systems. The proposed topology being a hybrid structure retains almost all the attractive properties of Balanced Hypercube and Varietal Hypercube. The topology, various parameters, routing and broadcasting of Balanced Varietal Hypercube are presented. The perfor...

We present an algorithm to generate a one-sided approximation of a given triangular mesh. We refer to such an approximate mesh as a bounding mesh, which includes the original mesh and has fewer vertices. Likewise, an inner bounding mesh is defined as an approximate mesh that is included by a given mesh. Our proposed bounding mesh algorithm performs iterative edge contractions and can generate b...

Reduced precision bounding volume hierarchies and ray traversal can significantly improve the efficiency of ray tracing through low-cost dedicated hardware. A key approach to enabling reduced precision computations during traversal is to translate the ray origin closer to the bounding volume hierarchy node after each traversal step. However, this approach precludes sharing of intersection compu...

Ordinary bounding volume hierarchy (BVH) construction algorithms create BVHs that approximate the boundary of the objects. In this paper, we present a BVH construction that instead approximates the volume of the objects with successively finer levels. It is based on Batch Neural Gas (BNG), a clustering algorithm that is known from machine learning. Additionally, we present a novel massively par...