4 search results - page 1 / 1 » Binary Space Partitions for Fat Rectangles |
26
Voted
SIAMCOMP
2000
13 years 10 months ago
2000
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...
ALGORITHMICA
2000
13 years 10 months ago
2000
We describe a new and simple method for constructing binary space partitions in arbitrary dimensions. We also introduce the concept of uncluttered scenes, which are scenes with a ...
SIGMOD
1999
ACM
14 years 3 months ago
1999
ACM
Selectivity estimation of queries is an important and wellstudied problem in relational database systems. In this paper, we examine selectivity estimation in the context of Geogra...
WAE
1998
14 years 4 days ago
1998
In recent years realistic input models for geometric algorithms have been studied. The most important models introduced are fatness, low density, unclutteredness, and small simple...