We present an efficient algorithm to perform approximate offsetting operations on geometric models using GPUs. Our approach approximates the boundary of an object with point samples and computes the offset by merging the balls centered at these points. The underlying approach uses Layered Depth Images (LDI) to organize the samples into structured points and performs parallel computations using ...

We describe a simple and robust algorithm for estimating 3D shape given a number of silhouette points obtained from two or more viewpoints and a parametric model of the shape. Our algorithm minimizes (in the least squares sense) the distances from the lines obtained by unprojecting the silhouette points to 3D to their closest silhouette points on the 3D shape. The solution is found using an ite...

in this paper we get some results and applications for duals and approximate duals of g-frames in hilbert spaces. in particular, we consider the stability of duals and approximate duals under bounded operators and we study duals and approximate duals of g-frames in the direct sum of hilbert spaces. we also obtain some results for perturbations of approximate duals.

Dedicated to Gerry Ladas on the occasion of his 60th Birthday Algorithmic aspects of a class of nite element collocation methods for the approximate numerical solution of elliptic partial diierential equations are described. Locally, for each nite element, the approximate solution is a polynomial. Polynomials corresponding to adjacent nite elements need not match continuously, but their values ...

Partially observable Markov decision processes (POMDPs) form an attractive and principled framework for agent planning under uncertainty. Point-based approximate techniques for POMDPs compute a policy based on a finite set of points collected in advance from the agent’s belief space. We present a randomized point-based value iteration algorithm called Perseus. The algorithm performs approximate...

Geospatial joins are a core building block of connected mobility applications. An especially challenging problem are joins between streaming points and static polygons. Since points are not known beforehand, they cannot be indexed. Nevertheless, points need to be mapped to polygons with low latencies to enable real-time feedback. We present an adaptive geospatial join that uses true hit filteri...

The paper demonstrates briefly the reasoning capabilities in condition monitoring offered by systems based on statement networks. The usefulness of the networks considered results among others from possibilities of their optimization related to the minimization of contradictions between rules acquired from different knowledge sources. A mechanical analogy of such networks introduces an interpre...

Title of Dissertation: Approximate Range Searching In The Absolute Error Model Guilherme Dias da Fonseca, Doctor of Philosophy, 2007 Dissertation directed by: Professor David M. Mount Department of Computer Science Range searching is a well known problem in computational geometry. We consider this problem in the context of approximation, where an approximation parameter ε > 0 is provided. Most ...

1. Abstract We present an incomplete series expansion (ISE) as a basis for function approximation. The ISE is expressed in terms of an approximate Hessian matrix which may contain second, third and even higher order ‘main’ or diagonal terms, but which excludes ‘interaction’ or off-diagonal terms. From the ISE, a family of approximate interpolating functions may be derived. The interpolating fun...