In this paper we present an acceleration method for volumetric ray tracing which utilizes standard graphics hardware without compromising image accuracy. The graphics hardware is employed to ident@ those segments of each ray that could possibly contribute to the jinal image. A volumetric ray tracing algorithm is then used to compute the$nal image, traversing only the identi$ed segments of the r...

In the field of collusion-resistant traitor tracing, Oosterwijk et al. recently determined the optimal suspicion function for simple decoders. Earlier, Moulin also considered another type of decoder: the generic joint decoder that compares all possible coalitions, and showed that usually the generic joint decoder outperforms the simple decoder. Both Amiri and Tardos, and Meerwald and Furon desc...

AIM The Monte Carlo dose calculation algorithm yields accurate dose distributions in heterogeneous media and interfaces. The Monte Carlo calculation algorithm provided in the Multiplan Cyberknife treatment planning system (Accuray, Sunnyvale, CA, USA) has five different dose-smoothing algorithms in it. As the principle of smoothing of these algorithms is different, they can produce a disparity ...

This paper presents a simple method for modeling and rendering refractive objects that are nested within each other. The technique allows the use of simpler scene geometry and can even improve rendering time in some images. The algorithm can be easily added into an existing ray tracer and makes no assumptions about the drawing primitives that have been implemented.

For many decades, ray tracing is known and well used for rendering highly realistic images. Since ray tracing simulates the physical transport of light even highly complex optical properties and illumination conditions can be rendered correctly. Due to these features ray tracing is used e.g. for commercials and movies, in architecture, and for visualizations of industrial prototypes. Especially...

Pareto optimality is capable of striking the optimal trade-off amongst the diverse conflicting QoS requirements of routing in wireless multihop networks. However, this comes at the cost of increased complexity owing to searching through the extended multi-objective search-space. We will demonstrate that the powerful quantum-assisted dynamic programming optimization framework is capable of circu...

An edge detection-based vessel tracing algorithm is presented to extract vascular tree structures present in medical images. Vasculatures are important features in biomedical image processing applications, such as in analyzing the biological process of angiogenesis. The presented algorithm first identifies points where blood vessels are likely to be then initiates traces from each identified se...

This paper presents an algorithm for generating the Interior Medial Axis Transform (iMAT) of 3D objects with free-form boundaries. The algorithm proposed uses the exact representation of the part and generates an approximate rational spline description of the iMAT. The algorithm generates the iMAT by a tracing technique that marches along the object’s boundary. The level of approximation is con...

We introduce a new problem statement of searching for an optimal wireless network infrastructure spatial configuration based on the information provided by the wireless network equipment. The problem is formulated as a discrete location problem with regional demand and a finite set of candidate solutions. The problem in pseudo-Boolean form is solved with the probability changing method, a rando...

We describe a method of producing ray-traced images of 2D environments at interactive rates. The 2D environment consists of a set of disjoint, convex polygons. Our technique is based on the visibility complex [17,19] [Pocchiola M, Vegter G. Proc Int J Comput GEOM Applic 1996;6(3):279}308. Rivière S. Visibility computations in 2D polygonal scenes. PhD thesis, Univ. Joseph Fourier, Grenoble I, Fr...