Patents by Inventor John Burgess

John Burgess has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20220165017
    Abstract: Enhanced techniques applicable to a ray tracing hardware accelerator for traversing a hierarchical acceleration structure are disclosed. The traversal efficiency of such hardware accelerators are improved, for example, by transforming a ray, in hardware, from the ray's coordinate space to two or more coordinate spaces at respective points in traversing the hierarchical acceleration structure. In one example, the hardware accelerator is configured to transform a ray, received from a processor, from the world space to at least one alternate world space and then to an object space in hardware before a corresponding ray-primitive intersection results are returned to the processor. The techniques disclosed herein facilitate the use of additional coordinate spaces to orient acceleration structures in a manner that more efficiently approximate the space occupied by the underlying primitives being ray-traced.
    Type: Application
    Filed: February 11, 2022
    Publication date: May 26, 2022
    Inventors: Gregory MUTHLER, John BURGESS, James ROBERTSON, Magnus ANDERSON
  • Patent number: 11328472
    Abstract: A hardware-based traversal coprocessor provides acceleration of tree traversal operations searching for intersections between primitives represented in a tree data structure and a ray. The primitives may include triangles used in generating a virtual scene. The hardware-based traversal coprocessor is configured to properly handle numerically challenging computations at or near edges and/or vertices of primitives and/or ensure that a single intersection is reported when a ray intersects a surface formed by primitives at or near edges and/or vertices of the primitives.
    Type: Grant
    Filed: September 25, 2020
    Date of Patent: May 10, 2022
    Assignee: NVIDIA Corporation
    Inventors: Samuli Laine, Tero Karras, Timo Aila, Robert Ohannessian, William Parsons Newhall, Jr., Greg Muthler, Ian Kwong, Peter Nelson, John Burgess
  • Publication number: 20220126020
    Abstract: A method of detecting a fault condition in an infusion process, the method includes receiving a programmed flow rate pertaining to a fluid infusion provided by an infusion device; determining, a first weight of an infusion container associated with the fluid infusion provided by the infusion device at a first time; determining a second weight of the infusion container at a second time; determining based on the first weight and the second weight, a determined flow rate of the fluid infusion provided by the infusion device between the first time and the second time. The method includes determining a difference between the determined flow rate and the programmed flow rate. When a magnitude of the difference between the determined flow rate and the programmed flow rate satisfies a predetermined threshold, by the processor: causing an output of the infusion device or the weight sensor to indicate the fault condition.
    Type: Application
    Filed: October 26, 2021
    Publication date: April 28, 2022
    Inventors: Daniel M. ABAL, Brendan John BURGESS, Ramkumar SUBRAMANIAN, Reza PAIAM, Ronald HIDALGO, Hermogenes ESCALA, James James HENNESSY
  • Patent number: 11304345
    Abstract: A door assembly is described. The door assembly includes a door structure that is mounted over an opening of an enclosure. The door structure includes a body that includes a first surface and a second surface opposite to the first surface. The first surface may face an inside of the enclosure when the door structure is closed. The door structure includes a number of finger bracket structures mounted on the first surface. Each one of the finger bracket structures includes a bracket and one or more finger gaskets coupled to the bracket. The finger gaskets of the finger bracket structures may contact enclosure brackets mounted around an edge of the opening of the enclosure when the door structure is closed. A combination of the finger gaskets in contact with enclosure brackets may create an electromagnetic interference (EMI) shield at the edge of the opening of the enclosure.
    Type: Grant
    Filed: August 12, 2020
    Date of Patent: April 12, 2022
    Assignee: CAREFUSION 303, INC.
    Inventors: Michael Rahilly, Edward Stephen Ferner, Jr., Brendan John Burgess, Scott Riley, Michael Dugan Joyce, Noe Arroyo, Chris Pedersen
  • Patent number: 11302056
    Abstract: Ray tracing hardware accelerators supporting multiple specifiers for controlling the traversal of a ray tracing acceleration data structure are disclosed. For example, traversal efficiency and complex ray tracing effects can be achieved by specifying traversals through such data structures using both programmable ray operations and explicit node masking. The explicit node masking utilizes dedicated fields in the ray and in nodes of the acceleration data structure to control traversals. Ray operations, however, are programmable per ray using opcodes and additional parameters to control traversals. Traversal efficiency is improved by enabling more aggressive culling of parts of the data structure based on the combination of explicit node masking and programmable ray operations. More complex ray tracing effects are enabled by providing for dynamic selection of nodes based on individual ray characteristics.
    Type: Grant
    Filed: June 10, 2020
    Date of Patent: April 12, 2022
    Assignee: NVIDIA CORPORATION
    Inventors: Gregory Muthler, John Burgess
  • Patent number: 11295508
    Abstract: A bounding volume is used to approximate the space an object occupies. If a more precise understanding beyond an approximation is required, the object itself is then inspected to determine what space it occupies. Often, a simple volume (such as an axis-aligned box) is used as bounding volume to approximate the space occupied by an object. But objects can be arbitrary, complicated shapes. So a simple volume often does not fit the object very well. That causes a lot of space that is not occupied by the object to be included in the approximation of the space being occupied by the object. Hardware-based techniques are disclosed herein, for example, for efficiently using multiple bounding volumes (such as axis-aligned bounding boxes) to represent, in effect, an arbitrarily shaped bounding volume to better fit the object, and for using such arbitrary bounding volumes to improve performance in applications such as ray tracing.
    Type: Grant
    Filed: June 10, 2020
    Date of Patent: April 5, 2022
    Assignee: NVIDIA Corporation
    Inventors: Gregory Muthler, John Burgess
  • Patent number: 11282261
    Abstract: Enhanced techniques applicable to a ray tracing hardware accelerator for traversing a hierarchical acceleration structure are disclosed. The traversal efficiency of such hardware accelerators are improved, for example, by transforming a ray, in hardware, from the ray's coordinate space to two or more coordinate spaces at respective points in traversing the hierarchical acceleration structure. In one example, the hardware accelerator is configured to transform a ray, received from a processor, from the world space to at least one alternate world space and then to an object space in hardware before a corresponding ray-primitive intersection results are returned to the processor. The techniques disclosed herein facilitate the use of additional coordinate spaces to orient acceleration structures in a manner that more efficiently approximate the space occupied by the underlying primitives being ray-traced.
    Type: Grant
    Filed: June 10, 2020
    Date of Patent: March 22, 2022
    Assignee: NVIDIA CORPORATION
    Inventors: Gregory Muthler, John Burgess, James Robertson, Magnus Andersson
  • Publication number: 20220058856
    Abstract: A hardware-based traversal coprocessor provides acceleration of tree traversal operations searching for intersections between primitives represented in a tree data structure and a ray. The primitives may include opaque and alpha triangles used in generating a virtual scene. The hardware-based traversal coprocessor is configured to determine primitives intersected by the ray, and return intersection information to a streaming multiprocessor for further processing. The hardware-based traversal coprocessor is configured to omit reporting of one or more primitives the ray is determined to intersect. The omitted primitives include primitives which are provably capable of being omitted without a functional impact on visualizing the virtual scene.
    Type: Application
    Filed: November 5, 2021
    Publication date: February 24, 2022
    Inventors: Greg Muthler, Tero Karras, Samuli Laine, William Parsons Newhall, JR., Ronald Charles Babich, JR., John Burgess, Ignacio Llamas
  • Publication number: 20220051792
    Abstract: An electronic tag includes a housing; a processor within the housing; a transceiver configured within the housing and coupled to the processor; a display coupled to the housing and the processor, and configured to display information received via the transceiver; a clamping mechanism coupled to the housing and configured to secure the electronic tag to an intravenous (IV) tubing; and a sensor configured within the housing, and configured to measure a property of a fluid in an IV tubing at a location of the clamping mechanism.
    Type: Application
    Filed: August 13, 2021
    Publication date: February 17, 2022
    Inventors: Brendan John BURGESS, Edward Stephen FERNER, Beth A. SCHNEIDER, Shannon John JOHNSON, Daniel M. ABAL
  • Publication number: 20220051468
    Abstract: Methods and systems are described in some examples for changing the traversal of an acceleration data structure in a highly dynamic query-specific manner, with each query specifying test parameters, a test opcode and a mapping of test results to actions. In an example ray tracing implementation, traversal of a bounding volume hierarchy by a ray is performed with the default behavior of the traversal being changed in accordance with results of a test performed using the test opcode and test parameters specified in the ray data structure and another test parameter specified in a node of the bounding volume hierarchy. In an example implementation a traversal coprocessor is configured to perform the traversal of the bounding volume hierarchy.
    Type: Application
    Filed: October 28, 2021
    Publication date: February 17, 2022
    Inventors: Samuli LAINE, Timo AILA, Tero KARRAS, Gregory MUTHLER, William P. NEWHALL, JR., Ronald C. BABICH, JR., Craig KOLB, Ignacio LLAMAS, John BURGESS
  • Publication number: 20220027280
    Abstract: In a ray tracer, a cache for streaming workloads groups ray requests for coherent successive bounding volume hierarchy traversal operations by sending common data down an attached data path to all ray requests in the group at the same time or about the same time. Grouping the requests provides good performance with a smaller number of cache lines.
    Type: Application
    Filed: September 23, 2021
    Publication date: January 27, 2022
    Inventors: Greg MUTHLER, Timo AILA, Tero KARRAS, Samuli LAINE, William Parsons NEWHALL, JR., Ronald Charles BABICH, JR., John BURGESS, Ignacio LLAMAS
  • Publication number: 20220020202
    Abstract: A hardware-based traversal coprocessor provides acceleration of tree traversal operations searching for intersections between primitives represented in a tree data structure and a ray. The primitives may include opaque and alpha triangles used in generating a virtual scene. The hardware-based traversal coprocessor is configured to determine primitives intersected by the ray, and return intersection information to a streaming multiprocessor for further processing. The hardware-based traversal coprocessor is configured to provide a deterministic result of intersected triangles regardless of the order that the memory subsystem returns triangle range blocks for processing, while opportunistically eliminating alpha intersections that lie further along the length of the ray than closer opaque intersections.
    Type: Application
    Filed: September 30, 2021
    Publication date: January 20, 2022
    Inventors: Samuli LAINE, Tero KARRAS, Greg MUTHLER, William Parsons NEWHALL, Ronald Charles BABICH, Ignacio LLAMAS, John BURGESS
  • Publication number: 20210401670
    Abstract: A system, method and device for determining a volume of a fluid in a medication container is disclosed. An infusion of a medication is initiated from a medication container. The medication container includes one or more radio frequency identification (RFID) tags affixed along a side of the container. A radio frequency (RF) signal is directed from a reader device toward the RFID tags disposed on the medication container. A signal strength of one or more returned respective RF signals from the one or more RFID tags is detected, the returned RF signals including one or more identifiers for identifying the one or more RFID tags. A threshold signal level for determining a level of fluid within the medication container is determined, and a volume of the fluid is then determined by determining which of the returned respective RF signals has a signal strength satisfying the threshold signal level.
    Type: Application
    Filed: June 25, 2021
    Publication date: December 30, 2021
    Inventors: Daniel M. ABAL, Brendan John BURGESS, Ramkumar SUBRAMANIAN
  • Publication number: 20210397449
    Abstract: Systems and methods for an efficient and robust multiprocessor-coprocessor interface that may be used between a streaming multiprocessor and an acceleration coprocessor in a GPU are provided. According to an example implementation, in order to perform an acceleration of a particular operation using the coprocessor, the multiprocessor: issues a series of write instructions to write input data for the operation into coprocessor-accessible storage locations, issues an operation instruction to cause the coprocessor to execute the particular operation; and then issues a series of read instructions to read result data of the operation from coprocessor-accessible storage locations to multiprocessor-accessible storage locations.
    Type: Application
    Filed: September 2, 2021
    Publication date: December 23, 2021
    Inventors: Ronald Charles BABICH, JR., John BURGESS, Jack CHOQUETTE, Tero KARRAS, Samuli LAINE, Ignacio LLAMAS, Gregory MUTHLER, William Parsons NEWHALL, JR.
  • Publication number: 20210398340
    Abstract: Techniques are disclosed for improving the throughput of ray intersection or visibility queries performed by a ray tracing hardware accelerator. Throughput is improved, for example, by releasing allocated resources before ray visibility query results are reported by the hardware accelerator. The allocated resources are released when the ray visibility query results can be stored in a compressed format outside of the allocated resources. When reporting the ray visibility query results, the results are reconstructed based on the results stored in the compressed format. The compressed format storage can be used for ray visibility queries that return no intersections or terminate on any hit ray visibility query. One or more individual components of allocated resources can also be independently deallocated based on the type of data to be returned and/or results of the ray visibility query.
    Type: Application
    Filed: June 18, 2020
    Publication date: December 23, 2021
    Inventors: Gregory MUTHLER, John BURGESS, Ronald Charles BABICH, JR., William Parsons Newhall, JR.
  • Publication number: 20210390760
    Abstract: Ray tracing hardware accelerators supporting motion blur and moving/deforming geometry are disclosed. For example, dynamic objects in an acceleration data structure are encoded with temporal and spatial information. The hardware includes circuitry that test ray intersections against moving/deforming geometry by applying such temporal and spatial information. Such circuitry accelerates the visibility sampling of moving geometry, including rigid body motion and object deformation, and its associated moving bounding volumes to a performance similar to that of the visibility sampling of static geometry.
    Type: Application
    Filed: June 15, 2020
    Publication date: December 16, 2021
    Inventors: Gregory MUTHLER, John Burgess
  • Publication number: 20210390755
    Abstract: Enhanced techniques applicable to a ray tracing hardware accelerator for traversing a hierarchical acceleration structure are disclosed. The traversal efficiency of such hardware accelerators are improved, for example, by transforming a ray, in hardware, from the ray's coordinate space to two or more coordinate spaces at respective points in traversing the hierarchical acceleration structure. In one example, the hardware accelerator is configured to transform a ray, received from a processor, from the world space to at least one alternate world space and then to an object space in hardware before a corresponding ray-primitive intersection results are returned to the processor. The techniques disclosed herein facilitate the use of additional coordinate spaces to orient acceleration structures in a manner that more efficiently approximate the space occupied by the underlying primitives being ray-traced.
    Type: Application
    Filed: June 10, 2020
    Publication date: December 16, 2021
    Inventors: Gregory MUTHLER, John BURGESS, James ROBERTSON, Magnus ANDERSSON
  • Publication number: 20210390758
    Abstract: Enhanced techniques applicable to a ray tracing hardware accelerator for traversing a hierarchical acceleration structure are disclosed. For example, traversal efficiency is improved by combining programmable traversals based on ray operations with per-node static configurations that modify traversal behavior. The per-node static configurations enable creators of acceleration data structures to optimize for potential traversals without necessarily requiring detailed information about ray characteristics and ray operations used when traversing the acceleration structure. Moreover, by providing for selective exclusion of certain nodes using per-node static configurations, less memory is needed to express an acceleration structure that includes, for example, different geometric levels of details corresponding to a single object.
    Type: Application
    Filed: June 11, 2020
    Publication date: December 16, 2021
    Inventors: Gregory MUTHLER, John BURGESS
  • Publication number: 20210390759
    Abstract: Enhanced techniques applicable to a ray tracing hardware accelerator for traversing a hierarchical acceleration structure and its underlying primitives are disclosed. For example, traversal speed is improved by grouping processing of primitives sharing at least one feature (e.g., a vertex or an edge) during ray-primitive intersection testing. Grouping the primitives for ray intersection testing can reduce processing (e.g., projections and transformations of primitive vertices and/or determining edge function values) because at least a portion of the processing results related to the shared feature in one primitive can be used in determine whether the ray intersects another primitive(s). Processing triangles sharing an edge can double the culling rate of the triangles in the ray/triangle intersection test without replicating the hardware.
    Type: Application
    Filed: June 15, 2020
    Publication date: December 16, 2021
    Inventors: Gregory MUTHLER, John BURGESS, Ian Chi Yan KWONG
  • Publication number: 20210390757
    Abstract: Ray tracing hardware accelerators supporting multiple specifiers for controlling the traversal of a ray tracing acceleration data structure are disclosed. For example, traversal efficiency and complex ray tracing effects can be achieved by specifying traversals through such data structures using both programmable ray operations and explicit node masking. The explicit node masking utilizes dedicated fields in the ray and in nodes of the acceleration data structure to control traversals. Ray operations, however, are programmable per ray using opcodes and additional parameters to control traversals. Traversal efficiency is improved by enabling more aggressive culling of parts of the data structure based on the combination of explicit node masking and programmable ray operations. More complex ray tracing effects are enabled by providing for dynamic selection of nodes based on individual ray characteristics.
    Type: Application
    Filed: June 10, 2020
    Publication date: December 16, 2021
    Inventors: Gregory MUTHLER, John BURGESS