Binary Space Partitions for Fat Rectangles

15 years 2 months ago

Download www.ittc.ku.edu

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

Pankaj K. Agarwal, Edward F. Grove, T. M. Murali,

Real-time Traffic

Binary Space Partitions | Practical Problem | SIAMCOMP 2000 | Two-dimensional Rectangles |

claim paper

» Selectivity Estimation in Spatial Databases

» Guarding Scenes against Invasive Hypercubes

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	SIAMCOMP
Authors	Pankaj K. Agarwal, Edward F. Grove, T. M. Murali, Jeffrey Scott Vitter

Comments (0)

Sciweavers

Binary Space Partitions for Fat Rectangles

Binary Space Partitions | Practical Problem | SIAMCOMP 2000 | Two-dimensional Rectangles |

Explore & Download

Productivity Tools

Sciweavers