A New Curve Recursive Subdivision Model of Similar Binary Tree Structure

A New Algorithm to Represent a Given k-ary Tree into Its Equivalent Binary Tree Structure

In this paper we have developed an algorithm that converts a given k-ary tree, for any k ≥ 3, to its equivalent binary tree structure. The binary tree is generated in O(n) time, for a k-ary tree with a total of n nodes. The algorithm is designed aiming at reducing the height of the constructed binary tree. The constructed tree does not contain any free links in the non-leaf nodes. That means th...

Subdivision-Curve Primitives: A New Solution for Interactive Implicit Modeling

To remain an attractive model, skeleton-based implicit surfaces have to allow the design and display of shapes at interactive rates. This paper focuses on surfaces whose skeletons are graphs of interconnected curves. We present subdivision-curve primitives that rely on convolution for generating bulge-free and crease-free implicit surfaces. These surfaces are efficiently yet correctly displayed...

Interproximate curve subdivision

This paper presents a new curve subdivision algorithm called interproximate subdivision for generating curves that interpolate some given vertices and approximate the other vertices. By the interproximate subdivision, only the vertices specified to be interpolated are fixed and the other vertices are updated at each refinement step. The refinement rules are derived to ensure that the eigenvalue...

A New Weight Balanced Binary Search Tree

Binary Recursive

Binary recursive partitioning (BRP) is a computationally-intensive statistical method that can be used in situations where linear models are often used. Instead of imposing many assumptions to arrive at a tractable statistical model, BRP simply seeks to accurately predict a response variable based on values of predictor variables. The method outputs a decision tree depicting the predictor varia...