We introduce a new representation for polyhedra by showing how Binary Space Partitioning
Trees (BSP trees) can be used to represent regular sets. We then show how they may be …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

BSP trees have been shown to provide an effective representation of polyhedra through the
use of spatial subdivision, and are an alternative to the topologically based b-reps. While …

We describe randomized algorithms for efficiently maintaining a binary space partition of
continuously moving, possibly intersecting, line segments in the plane, and of continuously …

Quadtrees are hierarchical spatial tree data structures that are based on the principle of
recursive decomposition of space. The term quadtree originated from representation of two …

A binary space partition tree is a data structure for the representation of a set of objects in
space. It found an increasing number of applications over the last decades. In recent years …

The search for better representations of geometric objects has produced as a candidate
Binary Space Partitioning Trees (BSP trees). By simply subdividing space recursively …

We describe the first known algorithm for efficiently maintaining a Binary Space Partition
(BSP) for n continuously moving segments in the plane. Under reasonable assumptions on …

An Empirical Comparison of Radiosity Algorithms Page 1 School of Computer Science
Carnegie Mellon University Pittsburgh, Pennsylvania 15213-3890 This report presents an …

We consider the practical problem of constructing binary space partitions (BSPs) for a set S
of n orthogonal, nonintersecting, two-dimensional rectangles in \BbbR^3 such that the …