We present a system for incorporating multiple level of detail (LOD) models of 3D objects within a single hierarchical data structure. This system was designed for a scientific visualization application involving terrain and volume rendering. Our data structure is a modified Binary Space Partitioning (BSP) tree. We describe how our tree construction and traversal routines may be used with a var...

Tree rotations (left and right) are basic local deformations allowing to transform between two unlabeled binary trees of the same size. Hence, there is a natural problem of practically finding such transformation path with low number of rotations, the optimal minimal number is called the rotation distance. Such distance could be used for instance to quantify similarity between two trees for var...

Database of human motion has been widely used for recognizing human motion and synthesizing humanoid motions. In this paper, we propose a data structure for storing and extracting human motion data and demonstrate that the database can be applied to the recognition and motion synthesis problems in robotics. We develop an efficient method for building a human motion database from a collection of...

Given a set S of n points on d, we show, for fixed d, how to construct in Ž . Ž . O n log n time a data structure we call the balanced aspect ratio BAR tree. A Ž . BAR tree is a binary space partition tree on S that has O log n depth in which Ž . every region is convex and ‘‘fat’’ that is, has a bounded aspect ratio . While previous hierarchical data structures such as k-d trees, quadtrees, oct...

We present a multiresolution model for surfaces which is able to handle large–scale global topographic data. It is based on a hierarchical decomposition of the sphere by a recursive bisection triangulation in geographic coordinates. Error indicators allow the representation of the data at various levels of detail and enable data compression by local omission of data values. The resulting hierar...

Author’s present address: GLUE Software Engineering, Ralligweg 10, CH-3012 Bern, email: [email protected], Tel +41 31 305 03 11, Fax +41 31 301 44 33 An algorithm for moving between adjacent regions in a binary digital image representated by a bintree is presented. This algorithm differs from other neighbour–finding algorithms in hierarchical image representations, as it exploits the nature of bintr...

Wireless sensor networks (WSNs) are large scale integration consists of hundreds or thousands or more number of sensor nodes. They are tiny, low cost, low weight, and limited battery, primary storage, processing power. They have wireless capabilities to monitor physical or environmental conditions. This paper compared the performance analysis of some existing routing protocols for target tracki...

— Segmentation-based image coding methods provide high compression ratios when compared with traditional image coding approaches like the transform and sub band coding for low bit-rate compression applications. In this paper, a segmentation-based image coding method, namely the Binary Space Partition scheme, that divides the desired image using a recursive procedure for coding is presented. The...

Complex systems are usually represented as an intricate set of relations between their components forming a complex graph or network. The understanding of their functioning and emergent properties are strongly related to their structural properties. The finding of structural patterns is of utmost importance to reduce the problem of understanding the structure–function relationships. Here we pro...