University of Calcutta

Rajat Kumar Pal

Ranjan Mehera

Angana Chakraborty

Novarun Deb

Technologies are generally provided for converting a k-ary tree to an equivalent height balanced binary tree. A k-ary tree root may be first set as the binary tree root. Nodes may then be inserted in the binary tree based on nodes of the k-ary tree. First two children of each k-ary tree node may be inserted as left and right children in the binary tree. If there are additional children, those may be inserted into a child queue. If there are less than two children in the k-ary tree, children from the child queue may be used to fill the left and right child nodes in the equivalent binary tree repeating the process level-wise until all nodes in the k-ary tree are processed.

K-ary tree to binary tree conversion through complete height balanced technique

Techniques generally disclosed herein relate to computation of a guard zone of a three-dimensional object. In some examples, guard zones may be computed by identifying intersection lines that couple adjacent planes of an object, and categorizing an external angle at an intersection line between adjacent planes as concave or convex. In some embodiments, for convex angles, a cylindrical surface can be determined that is located about an outside surface of the object and centered along the intersection line between the adjacent planes. In some embodiments, for concave angles, the external angle can be bisected with a bisection plane. A guard zone may be formed by one or more of (i) providing a guard zone plane parallel to the object that is a tangent to a given cylindrical surface, (ii) providing a guard zone plane parallel to the object that intersects a given bisection plane, and/or (iii) coupling adjacent guard zone planes.

Growing community of inventors

Kolkata, India

Rajat Kumar Pal