| 摘要 |
Embodiments use hierarchical continuous level of detail (H-CLOD) trees with inherited splitting plane partitioning to reduce visual artifacts in renderings. For example, a three-dimensional mesh can be iteratively split, according to iteratively defined splitting planes, until sub-meshes are smaller than a predetermined bucket size. Each splitting can define a hierarchical level of a tree, so that the original mesh is a root node, each split sub-mesh is a child node, and the smallest meshes are leaf nodes. An H-CLOD tree can be generated by simplifying and combining each group of sibling node sub-meshes bottom-up into a simplified parent mesh accounting for inherited splitting planes, so that the tree has a most simplified mesh as its root node and a most un-simplified mesh formed by a combination of its leaf nodes. At render time, traversing the H-CLOD tree can produce a desired level of detail from the pre-computed nodes. |
| 主权项 |
1. A method for generating a hierarchical continuous level of detail (H-CLOD) tree data structure for three-dimensional (3D) model rendering, the method comprising:
storing a raw 3D mesh of the 3D model to a root node of an unsimplified tree data structure; iteratively adding nodes to the unsimplified tree data structure from the raw 3D mesh by, for each lowest-level node of the tree data structure, until each lowest-level node has an associated mesh that is smaller than a predetermined bucket size:
partitioning the candidate mesh according to a candidate splitting plane determined for the lowest-level node to generate at least two child meshes;storing the candidate splitting plane to the set of local splitting planes; andstoring each of the at least two child meshes to a respective child node added to the lowest-level node, such that each child node becomes a lowest-level node in a respective branch of the unsimplified tree data structure; and iteratively generating an H-CLOD tree data structure from the unsimplified tree data structure by, for each non-leaf child node of the unsimplified tree data structure:
combining all meshes stored by children nodes of the non-leaf child node to form a pre-simplified mesh; andcomputing a simplified mesh from the pre-simplified mesh by removing a portion of 3D coordinate points only from polygons of the pre-simplified mesh that do not span any of the set of local splitting planes associated with the non-leaf child node. |
