首页> 外文期刊>Computers in Industry >Converting boundary representations to exact bintrees
【24h】

Converting boundary representations to exact bintrees

机译:将边界表示转换为精确的二叉树

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper exact bintree as a new class of hierarchical approximation models is introduced. A newalgorithm for the conversion from boundary representations to exact bintrees is developed on thebase of the bintree model, a generalization of the quadtree and octree. It allows face, edge and vertexnode types as well as the classical black, white and grey nodes. The exact bintree is a general methodof binary cellular models. The other corresponding binary models can be easily deduced from theexact bintree. Using them, the required amount of memory is less than that in terms of bintrees andoctrees.
机译:在本文中,引入了精确的二叉树作为一类新的层次逼近模型。在二叉树模型的基础上,开发了一种从边界表示到精确二叉树转换的新算法,即四叉树和八叉树的推广。它允许使用面,边和顶点节点类型以及经典的黑色,白色和灰色节点。确切的二叉树是二进制细胞模型的通用方法。其他相应的二元模型可以很容易地从精确的二叉树中推导出来。使用它们,所需的内存量少于就二叉树和八叉树而言。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号