%0 Journal Article
%T Study of virtual octree model for volume data<br>面向体数据的虚拟八叉树模型研究
%A 吕广宪
%A 潘懋
%A 王占刚
%A 丛威青
%J 计算机应用
%D 2006
%I 
%X Pointer-based octree and linear octree have their limitations either on time efficiency or storage efficiency. A pointerless/non-location-code virtual octree model based on multi-z-order-curves was proposed. In terms of time, the virtual octree provides fast access to the octree nodes by regularly partitioned node blocks and their index. In terms of storage, the virtual octree provides good compression by pointerless/non-location-code nodes and the node combination method based on regularly partitioned blocks. Test results show that the virtual octree has access efficiency as fast as pointer-based octree, and storage compression as good as linear octree. It is a good volume data model, and has wide application in volume graphics related areas.
%K Geospatial Information System(GIS)
%K volume graphics
%K volume data
%K octree
%K solid modelling<br>空间信息系统
%K 体图形学
%K 体数据
%K 八叉树
%K 实体建模
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=25F188FF4BF341E9&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=59906B3B2830C2C5&sid=D5D9606B73A02185&eid=2EE8C81DB5D48A50&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=11