Rapid, spatial-data viewing and manipulating including data partition and indexing
A high-density, distance-measuring laser system and an associated computer that processes the data collected by the laser system. The computer determines a data partition structure and stores that structure as a header file for the scan before data is collected. As the scan progresses, the computer collects data points until a predetermined threshold is met, at which point a block of data consisting of the data points up to the threshold is written to disk. The computer indexes each data block using all three coordinates of its constituent data points using, preferably, a flexible index, such as an R-tree. When a data block is completely filled, it is written to disk preferably with its index and, as a result, each data block is ready for access and manipulation virtually immediately after having been collected. Also, each data block can be independently manipulated and read from disk.
1. A method of using a laser-measurement device which scans in a regular pattern in two dimensions and that collects data having three-dimensional attributes, the data having the regular pattern in two dimensions, the method comprising the steps of:
determining a partition structure for the data based on the regular pattern of which the laser-measurement device scans before initiating a scan;
initiating the scan and, while the scan progresses, collecting the data in memory until the data fits a size criteria associated with the partition structure;
writing a block of data to disk when the data fits the size criteria;
before writing the block to disk, establishing an index based on the three-dimensional attributes of the data, the index corresponding to the block of data;
identifying a partition level which is appropriate to display based on a user's eye point;
determining a spatial query that will render the data according to the eye point; and
querying the data, including comparing the spatial query to the index.
2. The method according to claim 1 , wherein the partition structure is a quad-tree.
3. The method according to claim 1 , wherein the index is an R-tree.
4. The method according to claim 1 , further comprising:
storing the partition structure as a header file before the data is collected.
5. The method according to claim 1 , further comprising establishing a boundary based on three-dimensional attributes of the data; and
comparing the spatial query to the boundaries.
6. A laser system comprising:
collecting means for collecting point data having three-dimensional coordinates, the collecting means collecting point data in a regular pattern in two dimensions such that the point data have a regular pattern in two coordinates; and
means for performing the method of claim 1 .
7. A computer-readable storage media having computer-executable instructions stored thereon, wherein when executed performs the method of claim 1 .