This thesis reviews the fast marching method as a technique for computing the distance transform on GPU in the context of a radiotherapy planning software. The method has some interesting characteristics that, given the right circumstances, allow the distance transform to be computed for fewer voxels than commonly used alternatives. This can result in beneficial […]

May 3, 2013 by hgpu

In this paper, we address the problem of efficient execution of a computation pattern, referred to here as the irregular wavefront propagation pattern (IWPP), on hybrid systems with multiple CPUs and GPUs. The IWPP is common in several image processing operations. In the IWPP, data elements in the wavefront propagate waves to their neighboring elements […]

September 18, 2012 by hgpu

In this paper, we present a novel tree-based dynamic programming (TDP) algorithm for efficient stereo reconstruction. We employ the geodesic distance transformation for tree construction, which results in sound image over-segmentation and can be easily parallelized on graphic processing unit (GPU). Instead of building a single tree to convey message in dynamic programming (DP), we […]

August 7, 2011 by hgpu

This paper presents a signed distance transform algorithm using graphics hardware, which computes the scalar valued function of the Euclidean distance to a given manifold of co-dimension one. If the manifold is closed and orientable, the distance has a negative sign on one side of the manifold and a positive sign on the other. Triangle […]

July 18, 2011 by hgpu

We propose a novel distance field transform method based on an iterative method adaptively performed on an evolving active band. Our method utilizes a narrow band to store active grid points being computed. Unlike the conventional fast marching method, we do not maintain a priority queue, and instead, perform iterative computing inside the band. This […]

June 20, 2011 by hgpu

In recent years, considerable research has been devoted to the efficient representation, modeling, processing and rendering of point-based models (point clouds). Due to their conceptual simplicity and superior flexibility, point-based representations evolved into a valuable alternative to polygonal meshes. This paper explores the problem of extracting direct visibility from point clouds without explicitly reconstructing the […]

May 16, 2011 by hgpu

We present a general framework for computing two-dimensional Voronoi diagrams of different classes of sites under various distance functions. The framework is sufficiently general to support diagrams embedded on a family of two-dimensional parametric surfaces in $R^3$. The computation of the diagrams is carried out through the construction of envelopes of surfaces in 3-space provided […]

March 22, 2011 by hgpu

We present a general framework for computing Voronoi diagrams of different classes of sites under various distance functions in $R^3$. Most diagrams mentioned in the paper are in the plane. However, the framework is sufficiently general to support diagrams embedded on a family of two-dimensional parametric surfaces in three-dimensions. The computation of the diagrams is […]

March 22, 2011 by hgpu

This paper proposes a GPU implemented algorithm to determine the differences between two binary images using Distance Transformations. These differences are invariant to slight rotation and offsets, making the technique ideal for comparisons between images that are not perfectly aligned. The parallel processing capabilities of the GPU allows for faster implementation than on traditional desktop […]

March 16, 2011 by hgpu

Jump flooding algorithm (JFA) is an interesting way to utilize the graphics processing unit to efficiently compute Voronoi diagrams and distance transforms in 2D discrete space. This paper presents three novel variants of JFA. They focus on different aspects of JFA: the first variant can further reduce the errors of JFA; the second variant can […]

January 7, 2011 by hgpu

We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance field for each slice of a uniform spatial grid. We express the non-linear distance function of each primitive as a dot product of linear factors. The linear terms are efficiently […]

November 4, 2010 by hgpu

In this paper we propose a simple GPU-based approach for discrete incremental approximation of 3D Voronoi diagram. By constructing region maps via GPU. Nearest sites, space clustering, and shortest distance query can be quickly answered by looking up the region map. In addition, we propose another representation of the 3D Voronoi diagram for visualization.

October 27, 2010 by hgpu