会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明申请
    • Resetting of Dynamically Grown Accelerated Data Structure
    • 重构动态加速数据结构
    • US20100228781A1
    • 2010-09-09
    • US12391384
    • 2009-02-24
    • David Keith FowlerEric Oliver MejdrichPaul Emery SchardtRobert Allen Shearer
    • David Keith FowlerEric Oliver MejdrichPaul Emery SchardtRobert Allen Shearer
    • G06F17/30
    • G06T11/40
    • A circuit arrangement, program product and method are provided for resetting a dynamically grown Accelerated Data Structure (ADS) used in image processing in which an ADS is initialized by reusing the root node of a prior ADS and resetting at least one node in the prior ADS to break a link between the reset node and a linked-to node in the prior ADS. By doing so, the memory allocated to the prior ADS may be reused for the new ADS, without having to clear or wipe out all of the allocated memory. In addition, in some instances, given the similarity of many image frames, often some or all of the node structure of a prior ADS may be reused for a new ADS, requiring only the contents of nodes to be cleared, instead of having to clear out all of the nodes in the prior ADS. As a result, the processing overhead associated with initializing a new ADS can be significantly reduced.
    • 提供了一种电路布置,程序产品和方法,用于复位图像处理中使用的动态增长的加速数据结构(ADS),其中通过重新使用先前ADS的根节点并重新设置先前ADS中的至少一个节点来初始化ADS 以断开复位节点和先前ADS中的链接节点之间的链接。 通过这样做,分配给先前ADS的存储器可以重新用于新的ADS,而不必清除或消除所有分配的存储器。 另外,在某些情况下,给定许多图像帧的相似性,通常,先前ADS的节点结构中的一些或全部可以重新用于新的ADS,仅需要清除节点的内容,而不必清除 排除先前ADS中的所有节点。 结果,与初始化新的ADS相关联的处理开销可以显着降低。
    • 8. 发明申请
    • Updating Ray Traced Acceleration Data Structures Between Frames Based on Changing Perspective
    • 基于不断变化的视角,更新帧之间的光线跟踪加速数据结构
    • US20100188396A1
    • 2010-07-29
    • US12361019
    • 2009-01-28
    • Eric Oliver MejdrichPaul Emery SchardtRobert Allen ShearerMatthew Ray Tubbs
    • Eric Oliver MejdrichPaul Emery SchardtRobert Allen ShearerMatthew Ray Tubbs
    • G06T15/00
    • G06T15/06G06T17/005
    • A method, program product and system for conducting a ray tracing operation where the rendering compute requirement is reduced or otherwise adjusted in response to a changing vantage point. Aspects may update or reuse an acceleration data structure between frames in response to the changing vantage point. Tree and image construction quality may be adjusted in response to rapid changes in the camera perspective. Alternatively or additionally, tree building cycles may be skipped. All or some of the tree structure may be built in intervals, e.g., after a preset number of frames. More geometric image data may be added per leaf node in the tree in response to an increase in the rate of change. The quality of the rendering algorithm may additionally be reduced. A ray tracing algorithm may decrease the depth of recursion, and generate fewer cast and secondary rays. The ray tracer may further reduce the quality of soft shadows, resolution and global illumination samples, among other quality parameters. Alternatively, tree rebuilding may be skipped entirely in response to a high camera rate of change. Associated processes may create blur between frames to simulate motion blur.
    • 一种用于执行光线跟踪操作的方法,程序产品和系统,其中响应于不断变化的有利位置来减少或以其他方式调整渲染计算要求。 响应于不断变化的有利位置,方面可以更新或重新使用帧之间的加速度数据结构。 可以根据相机视角的快速变化来调整树木和图像施工质量。 或者或另外,可以跳过建树循环。 树结构的全部或一些可以以间隔内置,例如在预设数量的帧之后。 响应于变化率的增加,可以在树中的每个叶节点添加更多的几何图像数据。 还可以减少渲染算法的质量。 光线跟踪算法可以减少递归深度,并产生更少的投射和二次光线。 光线跟踪器可以进一步降低软阴影,分辨率和全局照明样本的质量以及其他质量参数。 或者,可以根据高摄像机的变化率来完全地跳过树重建。 相关过程可能会在帧之间产生模糊以模拟运动模糊。