• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >Three-dimensional binary space partitioning tree and constructive solid geometry tree construction from algebraic boundary representations.
【24h】

Three-dimensional binary space partitioning tree and constructive solid geometry tree construction from algebraic boundary representations.

机译：利用代数边界表示法构建三维二元空间划分树和构造实体几何树。

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The purpose of this thesis is to present a method to compute binary space partitioning (BSP) tree and constructive solid geometry (CSG) tree representations of an object whose faces consist of planar and non-planar surfaces. A class of objects that are describable by the surfaces bounding them are valid input for the algorithm of this thesis, although methods currently exist to compute the additional information necessary to process non-describable quadric objects [51, 52]. This work is motivated by reverse engineering of mechanical parts, in which a model of a part is recovered from information obtained by some sort of sensing technique (eg. CAT scanning, laser rangefinding). The recovery of a valid BSP-tree or CSG-tree description of an object from a boundary representation of it can provide useful information to an engineer in the area of reverse engineering and in other areas related to solid modeling as well. This thesis presents the details of the BB-family of algorithms to convert a boundary representation of a solid object to a BSP representation, a Halfspace CSG representation, and a Bounded Solid CSG representation of the object. In particular, the algorithms accept as input a valid boundary representation of an object consisting of piecewise implicit surfaces. A binary space partitioning tree representing the object is computed first (the BB algorithm), and is converted to a halfspace CSG representation of the object (the BBHC algorithm). In certain cases it is also possible to convert the BSP tree representation into a bounded solid CSG representation as well (the BBC algorithm).
机译：本文的目的是提出一种计算对象的二元空间划分（BSP）树和构造实体几何（CSG）树表示的方法，该对象的面孔由平面和非平面组成。尽管目前存在用于计算处理不可描述的二次对象所需的附加信息的方法，但是由包围它们的表面可描述的一类对象是本文算法的有效输入[51，52]。这项工作是由机械零件的逆向工程推动的，在机械零件中，零件的模型是从通过某种传感技术（例如CAT扫描，激光测距）获得的信息中恢复的。从对象的边界表示中恢复对象的有效BSP树或CSG树描述可以在逆向工程领域以及与实体建模相关的其他领域为工程师提供有用的信息。本文介绍了将对象的边界表示转换为对象的BSP表示，半空间CSG表示和有界实体CSG表示的BB系列算法的详细信息。特别地，算法接受由分段隐式表面组成的对象的有效边界表示作为输入。首先计算代表对象的二进制空间分区树（BB算法），然后将其转换为对象的半空间CSG表示（BBHC算法）。在某些情况下，也可以将BSP树表示形式转换为有界的固态CSG表示形式（BBC算法）。

著录项

  • 作者

    Buchele, Suzanne Fox.;

  • 作者单位

    The University of Texas at Austin.;

  • 授予单位 The University of Texas at Austin.;
  • 学科 Computer science.;Mathematics.
  • 学位 Ph.D.
  • 年度 1999
  • 页码 204 p.
  • 总页数 204
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号