Al Globus, "Octree optimization," Tech. Rep. RNR-90-011, NASA Ames Research Center, July 1990.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....is created which contains the minimum and maximum data value for its children cells. This is a common variant of standard ray grid techniques [35] and is especially similar to previous multi level grids [36] 37] The use of minimum maximum caching has been shown to be useful [28] 29] [38]. The ray isosurface traversal algorithm examines the min and max at each macrocell before deciding whether to recursively examine a deeper level or to proceed to the next cell. The typical complexity of this search will be O# 3 p n# for a three level hierarchy [36] While the worst case ....

Al Globus, "Octree optimization," Tech. Rep. RNR-90-011, NASA Ames Research Center, July 1990.

....is created which contains the minimum and maximum data value for its children cells. This is a common variant of standard ray grid techniques [35] and is especially similar to previous multi level grids [36] 37] The use of minimum maximum caching has been shown to be useful [28] 29] [38]. The ray isosurface traversal algorithm examines the min and max at each macrocell before deciding whether to recursively examine a deeper level or to proceed to the next cell. The typical complexity of this search will be O( 3 p n) for a three level hierarchy [36] While the worst case ....

Al Globus, "Octree optimization," Tech. Rep. RNR-90-011, NASA Ames Research Center, July 1990.

....or computational coordinates (p,q,r) Because the velocity at a critical point is zero, the velocity field in the neighborhood of the critical point is determined by the velocity gradients u. The critical points can be classified according to the eigenvalues and eigenvectors of u. Refer to Globus91b for more details. Figure 20. Critical point methods are used to locate stationary points in velocity fields and visualize the flow topology (Globus 91) Page 4 29 A useful feature detection technique for aeronautical applications was developed at MIT [Sujudi95] It locates the centers of swirling flows, which includes ....

Globus, A. (1991a), "Octree optimization," Proceedings of the SPIE conference on extracting meaning from complex data: processing, display, interaction, II, San Jose, California, pp. 2-10.

....are localized and large overlaps do not occur. The ambiguous cases present in our previous algorithm [3] are also resolved because full volume matching is performed. 5 Memory Optimization The octree implementation involves memory overhead. There have been approaches to reduce the memory overhead [29, 27]. The advantage of an octree, besides the ease at which difference and overlap can be computed, is that only a part of the octree needs to be in the main memory. The nodes in the memory can serve as a look up table which can be used to obtain the knowledge of its subregion from the summarized ....

Al Globus. Octree optimization. In Symposium on Electronic Imaging Science and Technology, SPIE/SPSE. SPIE/SPSE, 1991.

No context found.

A. Globus, "Octree Optimization", technical report RNR-90-011, NASA contract NAS 2-12961, Summer 1990, NASA Ames Research Center.

No context found.

Al Globus, "Octree optimization," Tech. Rep. RNR-90-011, NASA Ames Research Center, July 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC