This paper presents a method for fitting cylinders into a point cloud, derived from a terrestrial laser-scanned tree. Utilizing high scan quality data as the input, the resulting models describe the branching structure of the tree, capable of detecting branches with a diameter smaller than a centimeter. The cylinders are stored as a hierarchical tree-like data structure encapsulating parent-chi...

Nowadays, indexing has become essential for fast retrieval of results. Spatial databases are used in many applications which demand faster retrieval of data. These data are multidimensional. Designing index structure for spatial databases is current area of research. R-Tree is the most widely used index structure for multi-dimensional data. Many variants of R-Tree has evolved with each performi...

We study a time series model that can be viewed as a decision tree with Markov temporal structure. The model is intractable for exact calculations, thus we utilize variational approximations . We consider three different distributions for the approximation: one in which the Markov calculations are performed exactly and the layers of the decision tree are decoupled, one in which the decision tre...

This work presents a methodology for grouping structurally similar XML documents using clustering algorithms. Modeling XML documents with tree-like structures, we face the ‘clustering XML documents by structure’ problem as a ‘tree clustering’ problem, exploiting distances that estimate the similarity between those trees in terms of the hierarchical relationships of their nodes. We suggest the u...

This paper proposes a life-like presentation agent system called TablePresenter. In the TablePresenter, a user edits a table on Microsoft Excel, and also specifies the presentation contents for explaining the table in the form of tree structure, called presentation tree. The system then generates animated presentation by an agent. Presentation trees have intermediate nodes labeled as “contrast”...

The representation of relationships between haplotypes in a population is performed normally through the use of trees. Frequently, the selection of a single tree implies the application of maximum parsimony principles, being prone to interpretation errors. The adoption of a graph structure, rather than a tree-like structure, avoids making simplifying assumptions leaving open the number of possi...

A typical tabular business report contains a set of cells. The cells may contain raw numeric values, character labels, and formulas. This paper will present a bottom-up algorithm for visually documenting the cells in a set of tabular reports. The algorithm draws a tree-like structure in a view port. The nodes in the tree can represent the either a raw numeric value or a formula. The arcs in the...

CVT and XOR are two binary operations together used to calculate the sum of two non-negative integers on using a recursive mechanism. In this present study the convergence behaviors of this recursive mechanism has been captured through a tree like structure named as CVT-XOR Tree. We have analyzed how to identify the parent nodes, leaf nodes and internal nodes in the CVT-XOR Tree. We also provid...

Spatial data management has been an active area of intensive research for more than two decades. In order to support spatial objects in a database system several issues should be taken into consideration such as: spatial data models, indexing mechanisms, efficient query processing, cost models. One of the most influential access methods in the area is the R-tree structure proposed by Guttman in...

A DT is a classification scheme which generates a tree and a set of rules, representing the model of different classes, from a given dataset. As per Hans and Kamber [HK01], DT is a flow chart like tree structure, where each internal node denotes a test on an attribute, each branch represents an outcome of the test and leaf nodes represent the classes or class distributions. The top most node in...