节点文献
面向E~n多胞体表示的点树结构
The point-tree data structure for describing polytopes in E~n space
【摘要】 针对多维空间形体的几何与拓扑结构特点,本文提出了一种适用于E~n空间多胞体表示的数据结构——点树结构。与传统的“三表结构”相比,“点树结构”降低了E~n空间多胞体表示的时空复杂性,提高了计算机处理的效率。
【Abstract】 To counter the geometric and topological features of multi-dimensional objects, this paper puts forward a new data structure i.e. the point-tree data structure, which is suitable for describing polytopes in En space, Compared with the "three-table data structure" used in E3, this structure decreases the complexity of time and memory represented in En polytopes with the efficiency of computer processing heightened.
【关键词】 E~n空间;
多胞体;
数据结构;
点树结构;
【Key words】 Enspace; Polytope; Data structure; Point-tree data structure;
【Key words】 Enspace; Polytope; Data structure; Point-tree data structure;
- 【文献出处】 山东工程学院学报 ,Journal of Shandong Institute of Technology , 编辑部邮箱 ,1999年04期
- 【分类号】TP391.41
- 【下载频次】19