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

In-network indexing is a challenging problem in wireless sensor networks (WSNs), particularly when sensor nodes are mobile. In the past, several indexing structures have been proposed for WSNs for answering innetwork queries, however, their maintenance efficiency in the presence of mobile nodes is relatively less understood. Assuming that mobility of the nodes is driven by an underlying mobilit...

A binary space partitioning (bsp) tree represents a recursive, hierarchical subdivision of d-dimensional space into convex subspaces. BSP trees provide a computational representation of space that provides both a search structure and a representation of geometry. Constructing a bsp tree consists of partitioning a subspace by means of a hyperplane, which intersects the interior of that subspace,...

In this study, we aim to investigate the impact of core affinity on big data processing and discuss the potential for manycore partitioning that decides the core affinity based on the characteristics of threads, some of which are I/O intensive, some are computation intensive.

The ability to perform eecient collision detection is essential in virtual reality environments and their applications, such as walkthroughs. In this paper we re-explore a classical structure used for collision detection { the binary space partitioning tree. Unlike the common approach, which attributes equal likelihood to each possible query, we assume events that happened in the past are more ...

present study determines not only the total amounts of metals (cr, cu and pb) in superficial agricultural soil of sistan area in eastern iran, but also the chemical partitioning of these elements in seven statistically selected cases. the analysis was run for local soil, soil treated by non-contaminated organic, compost and chemical fertilizers as well as soil treated by metal-contaminated fer...