首页> 外国专利> Space partitioning trees using planes selected from a discrete set of orientations

Space partitioning trees using planes selected from a discrete set of orientations

机译:使用从一组离散方向中选择的平面对树进行空间划分

摘要

A method, system, and computer-readable storage medium are disclosed for partitioning a scene with discrete oriented planes. In one embodiment, a scene comprising a plurality of objects may be partitioned into a plurality of sub-regions. The sub-regions may be divided by a plurality of planes having orientations selected from a discrete set of orientations comprising at least one orientation that is not the x axis, y axis, or z axis and is at a nonzero angle with respect to the x, y, or z axes. The partitioned scene may be stored in a binary tree comprising a plurality of nodes. Each node may correspond to a sub-region. In one embodiment, a ray tracing query may be solved for a particular ray. In solving the ray tracing query, the tree may be traversed to identify a first object of the plurality of objects intersected by the ray.
机译:公开了一种用于用离散的定向平面划分场景的方法,系统和计算机可读存储介质。在一个实施例中,可以将包括多个对象的场景划分成多个子区域。所述子区域可以被多个平面划分,所述多个平面具有从离散的一组定向中选择的定向,所述离散的一组定向包括至少一个不是x轴,y轴或z轴并且相对于x呈非零角度的定向。 ,y或z轴。划分的场景可以存储在包括多个节点的二叉树中。每个节点可以对应于一个子区域。在一个实施例中,可以针对特定射线解决射线追踪查询。在求解光线追踪查询时,可以遍历树以识别与光线相交的多个物体中的第一物体。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号