Space partitioning techniques are a useful means of organizing geometric models into data structures. Such data structures provide easy and efficient access to a wide range of computer graphics and visualization applications like real-time rendering of large data bases, collision detection, point classification, etc. Binary Space Partitioning (BSP) trees are one of the most successful space par...

Binary Space Partition (BSP) tree and Constructive Solid Geometry (CSG) tree representations are both set-theoretic binary tree representations of solid objects used in solid modeling and computer graphics. Recently, an extension of the traditional BSP tree definition has been presented, in which surfaces used in the binary partition include curved surfaces in addition to planar surfaces. We ex...

Partitioning a digital circuit into modules before implementing on a single chip is key to balancing between test cost and test correctness of built-in current testing (BICT). Most partitioning methods use statistic analysis to find the threshold value and then to determine the size of a module. These methods are rigid and inflexible since IDDQ testing requires the measurement of an analog quan...

This paper presents a new hybrid neuro-fuzzy model which is capable of learning structure and parameters by means of recursive binary space partitioning BSP. Introduction Neuro-fuzzy systems (NFSs) [1] combine the learning ability of artificial neural nets (ANNs) with the linguistic interpretation capacity of fuzzy inference systems (FISs) [2]. This work makes use of BSP (Binary Space Partition...

The use of visual sensors may have high impact in robotic applications where it is required to measure the pose (position and orientation) and the visual features of objects moving in unstructured environments. In this paper, the problem of real-time estimation of the position and orientation of of multiple objects is considered. Special emphasis is devoted to the case when two or more objects ...

This paper describes an adaptation of BSP (Binary Space Partitioning) to represent the spherical surface partitioning defined by a spherical map. This structure is used in a point location algorithm, also described here. All algorithms are exact (roundoff free) based on exact computation paradigm.

Partitioning a digital circuit into modules before implementing on a single chip is key to balancing between test cost and test correctness of built-in current testing (BICT). Most partitioning methods use statistic analysis to find the threshold value and then to determine the size of a module. These methods are rigid and inflexible since IDDQ testing requires the measurement of an analog quan...