A fast algorithm for similarity registration for shapes with various topologies is put forward in this paper. Fourier transform and Geometric moments are explored here to calculate the rotation, scaling and translation parameters to register two shapes by minimizing a dissimilarity measure introduced in the literature. Shapes are represented by signed distance functions. In comparison with the ...

This paper is motivated by the concept of nonnegative signed domination that was introduced by Huang, Li, and Feng in 2013 [15]. We study the non-negative signed domination problem from the theoretical point of view. For networks modeled by strongly chordal graphs and distance-hereditary graphs, we show that the non-negative signed domination problem can be solved in polynomial time. For networ...

Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-hard. The best guaranteed error bounded is the 3/2approximation algorithm. However, the problem of sorting signed permutation can be solved easily. Fast algorithms have been developed both for finding the sorting sequen...

When we use range finders to observe the shape of an object, many occluded areas may occur. These become holes and gaps in the model and make it undesirable to utilize the model for various applications. We propose a novel method to fill holes and gaps and complement such an incomplete model. We use a signed distance field (SDF) as an intermediate representation, which stores Euclidean signed d...

For the total cost of the inventory without backorder model, if we fuzzify the order quantity, the total demand, the cost of storing and the cost of placing an order as fuzzy numbers then we can obtain the fuzzy total cost. In this paper, we apply the signed distance method to defuzzify the fuzzy total cost and then solve the optimal order quantity.

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...

The latest advancements in Virtual Reality(VR) enable the creation of 3D models within a holographic immersive simulation environment. In this paper, we create QuickCSGModeling , user-friendly mid-air interactive modeling system. We first prepare dataset consisting diverse components and precompute discrete signed distance function (SDF) for each component. During phase, users can freely design...