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...

We model the societal task of redistricting political districts as a partitioning problem: Given set n points in plane, each belonging to one two parties, and parameter k, our goal is compute partition P plane into regions so that region contains roughly s = n/k points. should satisfy notion "local" fairness, which related core, well-studied concept cooperative game theory. A associated with ma...

In this paper an acceleration method for finding the nearest ray–object intersection for ray tracing purposes is presented. We use the concept of BSP trees enriched by rope trees. These are used to accelerate the traversal of the BSP tree. We give a comparison of experimental results between the technique based on BSP tree and uniform spatial subdivision.

This paper presents a unified approach to colour image coding, content-based indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, traditionally used in gray scale image coding [1, 2] is extended to represent colour images. The BSP tree, hence the structure, of the image is explicitly coded. A method is developed to compute the similarities of images based...

We present an efficient algorithm for collision determination of dynamic objects undergoing rigid motion or general deformation. Our technique deals with triangulated models, and it requires no further assumption of the objects’ geometry and topology. Particularly, it efficiently handles non-convex, or even polygon-soup models, enduring any deformation process. Furthermore, it requires no compl...

The Binary Space Partitioning (BSP) tree achieves fast hidden surface removal for most practical applications where an observer can move through a scene of static objects. However, the BSP algorithm generally increases the number of polygons in a scene due to its splitting stage resulting in a detrimental effect on the priority ordering and more significantly, the display calculations (shading,...