Efficient data structure
First Claim
1. A data structure for representing a spatial region, comprising:
- plurality of nodes associated hierarchically arranged in a shared, regularly-subdivided tree arrangement wherein;
each node corresponds to a regular spatial subdivision of the spatial region;
the hierarchical arrangement of nodes forms a directed acyclic graph and the hierarchical arrangement of nodes comprises leaf nodes, wherein each leaf node is associated with data that defines spatial content of the spatial region subdivision associated with the leaf node.
4 Assignments
0 Petitions
Accused Products
Abstract
In one embodiment, the present invention is directed to a data structure for representing a spatial region. The data structure comprises a hierarchical arrangement of nodes associated with a plurality of refinement levels, wherein each node of the hierarchical arrangement of nodes is a regular spatial subdivision of the spatial region or another node that is associated with a preceding refinement level. The hierarchical arrangement of nodes forms a directed acyclic graph. The hierarchical arrangement of nodes comprises at least two nodes that have respective edges that are traversed to a common child node such that the hierarchical arrangement of nodes does not comprise a repeated pattern from any two nodes of a common refinement level of the data structure.
-
Citations
20 Claims
-
1. A data structure for representing a spatial region, comprising:
-
plurality of nodes associated hierarchically arranged in a shared, regularly-subdivided tree arrangement wherein;
each node corresponds to a regular spatial subdivision of the spatial region;
the hierarchical arrangement of nodes forms a directed acyclic graph and the hierarchical arrangement of nodes comprises leaf nodes, wherein each leaf node is associated with data that defines spatial content of the spatial region subdivision associated with the leaf node. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A computer aided design (CAD) system, comprising:
-
interface means configured to receive input defining at least a portion of an engineered structure; and
processing means configured to modify data that represents at least a portion of the defined engineered structure, wherein;
the data structurally comprises a plurality of nodes hierarchically arranged in a shared, regularly-subdivided tree arrangement including a plurality of leaf nodes;
each of the plurality of nodes is a spatial subdivision of another node associated with a higher hierarchical level; and
the data includes content data associating each of the plurality of leaf nodes with contents of a corresponding regular subdivision of the engineered structure. - View Dependent Claims (9, 10, 11, 12, 13, 14, 15, 16, 17)
-
-
18. A program product, comprising:
-
a computer-readable storage medium; and
means recorded on the computer-readable storage medium for processing data associated with a multidimensional object, wherein;
the data substantially represents the multidimensional object as corresponding to a plurality of nodes hierarchically arranged in a shared, regularly-subdivided tree arrangement;
the plurality of nodes each correspond to at least one of a plurality of regular spatial subdivisions of the multidimensional object;
the plurality of hierarchical nodes comprises pluralities of first and second nodes;
the data includes content data and pointer data;
the content data is associated with the plurality of first nodes;
the pointer data is associated with the plurality of second nodes; and
the pointer data links each of the plurality of second nodes to a corresponding one of the plurality of first nodes where ones of the plurality of multidimensional object subdivisions corresponding to linked ones of the pluralities of first and second nodes have substantially similar contents. - View Dependent Claims (19, 20)
-
Specification