首页> 外国专利> Method of producing a sequence of triangles from a vertex raster with and without half resolution edges while decompressing a compressed geometry stream

Method of producing a sequence of triangles from a vertex raster with and without half resolution edges while decompressing a compressed geometry stream

机译:在解压缩压缩的几何流的同时从具有和不具有半分辨率边缘的顶点栅格生成一系列三角形的方法

摘要

A method of producing a sequence of triangles from a compressed geometry stream that includes an array of vertices includes steps of parsing vertices and pushing the parsed vertices into a buffer until the last vertex of the current row of the array is parsed and pushed. The first vertex of the current row is then re-used from the buffer and drawn. The first vertex of the next row is then parsed from the geometry stream, pushed into the buffer and drawn. Thereafter, it is determined whether a quad split bit is asserted. If the quad split bit is not asserted, the next vertex from the current row is parsed, pushed into the buffer, and drawn. The next vertex of the previous row is then re- used from the buffer and the re-used next vertex is drawn. If the quad split bit is asserted, the next vertex of the previous row is re-used from the buffer and drawn. The next vertex from the current row is then parsed and pushed into the buffer. Thereafter, the method returns to the determining step until the last vertex of the current row is reached, and returns to the first vertex re-using step until the last vertex of the array is reached. A triangle is formed from each three consecutive drawn vertices, to thereby create the sequence of triangles, starting from the beginning of each row. The raster may include one or more half- resolution edges, wherein alternate vertices are dropped and not drawn.
机译:一种从包括顶点阵列的压缩几何流产生三角形序列的方法,包括以下步骤:解析顶点并将解析后的顶点推入缓冲区,直到解析并推送阵列当前行的最后一个顶点为止。然后,从缓冲区重新使用当前行的第一个顶点并进行绘制。然后从几何流中解析下一行的第一个顶点,将其推入缓冲区并绘制。此后,确定是否确定四分割位。如果未声明四元分割位,则将分析当前行的下一个顶点,将其推入缓冲区并绘制。然后,从缓冲区重新使用上一行的下一个顶点,并绘制重复使用的下一个顶点。如果断言了四分割位,则从缓冲区重新使用前一行的下一个顶点并进行绘制。然后,将解析当前行中的下一个顶点并将其推入缓冲区。此后,该方法返回到确定步骤,直到到达当前行的最后一个顶点为止,并返回到第一个顶点重用步骤,直到到达数组的最后一个顶点为止。由每三个连续绘制的顶点组成一个三角形,从而从每行的开头开始创建三角形序列。栅格可以包括一个或多个半分辨率边缘,其中交替的顶点被放置而不绘制。

著录项

  • 公开/公告号US6028607A

    专利类型

  • 公开/公告日2000-02-22

    原文格式PDF

  • 申请/专利权人 SUN MICROSYSTEMS INC.;

    申请/专利号US19980007525

  • 发明设计人 JEFFREY M. CHAN;

    申请日1998-01-15

  • 分类号G06T17/20;

  • 国家 US

  • 入库时间 2022-08-22 01:37:47

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号