Isosurfaces, one of the most fundamental volumetric visualization tools, are commonly rendered using the wellknown Marching Cubes cases that approximate contours of trilinearly-interpolated scalar fields. While a complete set of cases has recently been published by Nielson, the formal proof that these cases are the only ones possible and that they are topologically correct is difficult to follo...

damage response, and these functions may be independent. We propose that in response to low levels of DNA damage, the ATM-dependent prosurvival function springs into action. If this function is defective, DNA damage will accumulate activating a cell death pathway that may not involve a proapoptotic function of Bid. On the other hand, high levels of DNA damage could lead to activation of the pro...

A major challenge when designing general purpose graphics hardware is to allow efficient access to texture data. Although different rendering paradigms vary with respect to their data access patterns, there is no flexibility when it comes to data caching provided by the graphics architecture. In this paper we focus on volume ray-casting, and show the benefits of algorithm-aware data caching. Ou...

In this article is presented an efficient implementation of the Marching Cubes Algorithm using nVidia’s CUDA technology, which can handle datasets that are so large that they cannot be loaded into the working memory of the used computer. Two kinds of data are considered: a single 3D grid that is too large to fit in memory and many, temporal 3D grids that individually fit in memory, but combined...

This paper presents a new approach for constructing a consistent (non-manifold) mesh based on non-binary datasets. Mesh generation is the method of choice if a surface is extracted based on labeled volumetric datasets. In most cases, the traditional Marching Cubes algorithm or one of its extensions is applied for generating meshes of binary labeled input data. However, for different – especiall...

In this note we present an implementation of the fast marching algorithm for solving Eikonal equations that reduces the original run-time from O(N logN) to linear. This lower run-time cost is obtained while keeping an error bound of the same order of magnitude as the original algorithm. This improvement is achieved introducing the straight forward untidy priority queue, obtained via a quantizat...

Abslracl. We dcscribe a thcorctical formulation for stereo in terms of the Bayesian approach to vision and rclatc it to psychophysical experiments. The formulation enables us to integrate the depth information from dilI'erent types of matching primitives, or from different vision modules. Wc solvc the correspondence problem using comparibiliry constraints bctwecn fcatures and prior assumprions ...

This paper describes extensions of the generalized summation-by-parts (GSBP) framework to the approximation of the second derivative with a variable coefficient and to time integration. GSBP operators for the second derivative lead to more efficient discretizations, relative to the classical finite-difference SBP approach, as they can require fewer nodes for a given order of accuracy. Similarly...

One of the most popular methods to solve a time-domain integral equation (TDIE) is the marching-on in time (MOT) method. Recently, a new method called marching-on in degree (MOD) that uses Laguerre polynomials as temporal basis functions has been developed to eliminate the late time instability of the MOT method. The use of an entire domain basis for the time variable eliminates the requirement...

Efficient and reliable path planning is crucial for smart ships when avoiding collisions with static dynamic obstacles in complex marine environments. This research proposes a novel method based on the fast marching to specifically assist safe navigation autonomous ships. At very beginning, unified representation specially produced describe space parametric speed function. In addition, spatial–...