Let In be the class of all signed involutions in the hyperoctahedral group Bn and let In(T ) be the set of involutions in In which avoid a set T of signed patterns. In this paper, we complete a further case of the program initiated by Simion and Schmidt [6] by enumerating In(T ) for all signed permutations T ⊆ B2.

This paper presents a GPU-based approach to handle collision detection and response for particles on 3D models. Signed Hausdorff distance fields were used and stored in volume textures. The voxels in a distance field stored the Hausdorff distance to the 3D model and the normal of the corresponding nearest surface. Object-based collision detection and response were processed using a pixel shader...

A signed k-partite graph (signed multipartite graph) is a k-partite graph in which each edge is assigned a positive or a negative sign. If G(V1, V2, · · · , Vk) is a signed k-partite graph with Vi = {vi1, vi2, · · · , vini}, 1 ≤ i ≤ k, the signed degree of vij is sdeg(vij) = dij = d + ij − d − ij , where 1 ≤ i ≤ k, 1 ≤ j ≤ ni and d + ij(d − ij) is the number of positive (negative) edges inciden...

In this paper, we propose and evaluate various distanceaware weighting strategies to improve reconstruction accuracy of a voxelbased model according to the Truncated Signed Distance Function (TSDF), from the data obtained by low-cost depth sensors. We look at two strategy directions: (a) weight definition strategies prioritizing importance of the sensed data depending on the data accuracy, and ...