|
⇤ ← Revision 1 as of 2005-02-14 03:52:49
Size: 669
Comment:
|
Size: 1053
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 4: | Line 4: |
| 1. The points are collected into cells and the cells make up a grid. | 1. The points are collected into cells and the cells make up a grid. Each cell has a density, and number of points associated with it. 1. The grid is put into one bucket whose lowerBound and upperBound are not points, but are designated by cells in the grid. Therefore the lowerBound will always be (0,0,0,0) for the first bucket and (X,X,X,X) where X is the last cell in each dimension. 1. From here on, we deal only with cells in buckets. |
Here is a brief description of the layout of the Objects in my Project and how the binary search partition is built.
- At the bottom we have points that are either read in or generated randomly
- The points are collected into cells and the cells make up a grid. Each cell has a density, and number of points associated with it.
- The grid is put into one bucket whose lowerBound and upperBound are not points, but are designated by cells in the grid. Therefore the lowerBound will always be (0,0,0,0) for the first bucket and (X,X,X,X) where X is the last cell in each dimension.
- From here on, we deal only with cells in buckets.
The question is what parameters decide the cell size/shape and grid size and shape? We determine this in the following way:
- Find the lower and upper bound in each dimesion lowerBound = (wl,xl,yl,zl) and upperBound = (wu,xu,yu,zu). Often this is given by the random point generating function.
- Given the resolution of the grid we can now determine the size/shape of the cells.