초록 ▼

A technique for reducing the total storage used in representing data having spatial extents. The data is represented in a tree structure having a plurality of nodes, wherein each of the nodes has parent and child relationship to one or more others of the nodes in the tree structure. An encoded repre

A technique for reducing the total storage used in representing data having spatial extents. The data is represented in a tree structure having a plurality of nodes, wherein each of the nodes has parent and child relationship to one or more others of the nodes in the tree structure. An encoded representation of the relation of a child node's extents with respect to its parent is stored in the node. A preorder traversal of the tree structure is performed to store it compactly in an output file.

대표청구항 ▼

1. A computer-implemented method for representing and encoding data having spatial extents, comprising:(a) representing the data in a tree structure having a plurality of nodes; and (b) encoding a spatial identifier for each node as a representation of the node's extents with respect to its parent's

1. A computer-implemented method for representing and encoding data having spatial extents, comprising:(a) representing the data in a tree structure having a plurality of nodes; and (b) encoding a spatial identifier for each node as a representation of the node's extents with respect to its parent's extents, wherein the encoded spatial identifier includes at least octant, {fraction (1/16)}th overlap, and degenerate axis Values.