P. K. Agarwal, L. Guibas, T. M. Murali, and J. S. Vitter. “Cylindrical Static and Kinetic Binary Space Partitions,” Computational Geometry, 16(2), 2000, 103–127. An extended abstract appears in Proceedings of the 13th Annual ACM Symposium on Computational Geometry (SCG ’97), Nice, France, June 1997, 39–48
Space partitioning techniques are well known especially because of their use in computer graphics, e...
AbstractWe show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane c...
We present a binary space partition algorithm for a set of disjoint isothetic rectangles. It recursi...
P. K. Agarwal, L. Guibas, T. M. Murali, and J. S. Vitter. “Cylindrical Static and Kinetic Binary Spa...
AbstractWe describe the first known algorithm for efficiently maintaining a Binary Space Partition (...
We consider the problem of constructing of binary space partitions (BSP) for a set S of n hyperrecta...
We consider the problem of constructing of binary space partitions (BSP) for a set S of n hy-perrect...
AbstractA binary space partition is a recursive partitioning of a configuration of objects by hyperp...
AbstractWe prove the existence of linear size binary space partitions for sets of objects in the pla...
A binary space partition is a recursive partitioning of a configuration of objects by hyperplanes un...
We present a new technique to maintain a BSP for a set of n moving disjoint segments in the plane. O...
This is the published version. Copyright © 2000 Society for Industrial and Applied Mathematic
Binary Space Partitioning (BSP) trees have some qualities that make them useful in solving many grap...
A BSP (binary space partitioning) tree is a commonly used spatial subdivision data structure in many...
We consider schemes for recursively dividing a set of geometric objects by hyperplanes until all obj...
Space partitioning techniques are well known especially because of their use in computer graphics, e...
AbstractWe show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane c...
We present a binary space partition algorithm for a set of disjoint isothetic rectangles. It recursi...
P. K. Agarwal, L. Guibas, T. M. Murali, and J. S. Vitter. “Cylindrical Static and Kinetic Binary Spa...
AbstractWe describe the first known algorithm for efficiently maintaining a Binary Space Partition (...
We consider the problem of constructing of binary space partitions (BSP) for a set S of n hyperrecta...
We consider the problem of constructing of binary space partitions (BSP) for a set S of n hy-perrect...
AbstractA binary space partition is a recursive partitioning of a configuration of objects by hyperp...
AbstractWe prove the existence of linear size binary space partitions for sets of objects in the pla...
A binary space partition is a recursive partitioning of a configuration of objects by hyperplanes un...
We present a new technique to maintain a BSP for a set of n moving disjoint segments in the plane. O...
This is the published version. Copyright © 2000 Society for Industrial and Applied Mathematic
Binary Space Partitioning (BSP) trees have some qualities that make them useful in solving many grap...
A BSP (binary space partitioning) tree is a commonly used spatial subdivision data structure in many...
We consider schemes for recursively dividing a set of geometric objects by hyperplanes until all obj...
Space partitioning techniques are well known especially because of their use in computer graphics, e...
AbstractWe show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane c...
We present a binary space partition algorithm for a set of disjoint isothetic rectangles. It recursi...
DOI
Add to ORKG