We study the String Reversal Distance problem, an extension of the well-known Sorting by Reversals problem. String Reversal Distance takes two strings S and T as input, and asks for a minimum number of reversals to obtain T from S. We consider four variants: String Reversal Distance, String Prefix Reversal Distance (in which any reversal must include the first letter of the string), and the sig...

1. Baerentzen J.A., Aanaes H., 2005, Signed distance computation using the angle weighted pseudonormal, IEEE Transactions on Visualization and Computer Graphics, 11, 3, 243-253. CrossRef Google Scholar

Signed distance functions computed in discrete form from given RGB-D data as regular voxel grids can represent manifold shapes the zero crossing of a trivariate function; corresponding meshes be derived by Marching Cubes algorithm. However, 3D models automatically reconstructed this way often contain irrelevant objects or artifacts, such holes noise, due to erroneous scan and error-prone recons...

Including derivative information in the modelling of moving interfaces has been proposed as one method to increase the accuracy of numerical schemes with minimal additional cost. Here a new level set reinitialization technique using the fast marching method is presented. This augmented fast marching method will calculate the signed distance function and up to the secondorder derivatives of the ...

In this paper we present an efficient method to compute the signed distance field for a large triangle mesh, which can run interactively with GPU accelerated. Restricted by absence of flexible pointer addressing on GPU, we design a novel multi-layer hash table to organize the voxel/triangle overlap pairs as two-tuples, such strategy provides an efficient way to store and access. Based on the ge...

We present an algorithm for fast continuous collision detection between points and signed distance fields. Such robust queries are often needed in computer animation, haptics and virtual reality applications, but have so far only been investigated for polygon (triangular) geometry representations. We demonstrate how to use an octree subdivision of the distance field for fast traversal of distan...