Abstract: Methods and intersection testing modules are provided for determining, in a ray tracing system, whether a ray intersects a 3D axis-aligned box representing a volume defined by a front-facing plane and a back-facing plane for each dimension. The front-facing plane of the box which intersects the ray furthest along the ray is identified. It is determined whether the ray intersects the identified front-facing plane at a position that is no further along the ray than positions at which the ray intersects the back-facing planes in a subset of the dimensions, and this determination is used to determine whether the ray intersects the axis-aligned box. The subset of dimensions comprises the two dimensions for which the front-facing plane was not identified, but does not comprise the dimension for which the front-facing plane was identified.

Abstract: Ray tracing systems and computer-implemented methods for generating a hierarchical acceleration structure for intersection testing in a ray tracing system. Nodes of the hierarchical acceleration structure are determined, wherein each of the nodes represents a region in a scene, and wherein the nodes are linked to form the hierarchical acceleration structure. Data is stored representing the hierarchical acceleration structure including data defining the regions represented by a plurality of the nodes of the hierarchical acceleration structure. At least one node is an implicitly represented node, wherein data defining a region represented by an implicitly represented node is not explicitly included as part of the stored data but can be inferred from the stored data.

Abstract: Ray tracing systems and methods generate a hierarchical acceleration structure to be used for intersection testing in a ray tracing system. Nodes of the hierarchical acceleration structure are determined, each representing a region in a scene, and being linked to form the hierarchical acceleration structure. Data is stored representing the hierarchical acceleration structure, including data defining the regions represented by a plurality of the nodes. At least one node is an implicitly represented node, wherein data defining a region represented by an implicitly represented node is not explicitly included as part of the stored data but can be inferred from the stored data. Intersection testing in the ray tracing system is performed in which, based on conditions in the ray tracing system, a determination is made as to whether testing of one or more rays for intersection with a region represented by a particular node of a sub-tree is to be skipped.

Abstract: A floor cleaner including a base movable over a surface to be cleaned, a suction nozzle provided on the base having a suction inlet, a body portion having a fluid dispensing member selectively removable from the body portion, the body portion being pivotally mounted to the base movable between an upright storage position and an inclined floor cleaning position, a suction source in fluid communication with the suction nozzle, and a reservoir configured to provide solution. The fluid dispensing member includes a grip, a dispensing nozzle in fluid communication with the reservoir, and an actuator. The fluid dispensing member is configured to deliver solution from the reservoir through the dispensing nozzle upon user actuation of the actuator, independent of function of the base and body of the floor cleaner.

Abstract: A hierarchical acceleration structure is generated for intersection testing in a ray tracing system. Nodes of the hierarchical acceleration structure are determined, wherein each of the nodes represents a region in a scene, and wherein the nodes are linked to form the hierarchical acceleration structure. Data is stored representing the hierarchical acceleration structure. The stored data defines the regions represented by a plurality of the nodes of the hierarchical acceleration structure. At least one node is an implicitly represented node, wherein data defining a region represented by an implicitly represented node is not explicitly included as part of the stored data but can be inferred from the stored data.

Abstract: Ray tracing systems and computer-implemented methods for generating a hierarchical acceleration structure for intersection testing. Nodes of the hierarchical acceleration structure are determined, wherein each of the nodes represents a region in a scene, and wherein the nodes are linked to form the hierarchical acceleration structure. Data is stored representing the hierarchical acceleration structure. The stored data comprises data defining the regions represented by a plurality of the nodes. At least one node is an implicitly represented node, wherein data defining a region represented by an implicitly represented node is not explicitly included as part of the stored data but can be inferred from the stored data.

Abstract: A method of converting 10-bit pixel data (e.g. 10:10:10:2 data) into 8-bit pixel data involves converting the 10-bit values to 7-bits or 8-bits and generating error values for each of the converted values. Two of the 8-bit output channels comprise a combination of a converted 7-bit value and one of the bits from the fourth input channel. A third 8-bit output channel comprises the converted 8-bit value and the fourth 8-bit output channel comprises the error values. In various examples, the bits of the error values may be interleaved when they are packed into the fourth output channel.

Abstract: Ray tracing systems and computer-implemented methods are described for performing intersection testing on a bundle of rays with respect to a box. Silhouette edges of the box are identified from the perspective of the bundle of rays. For each of the identified silhouette edges, components of a vector providing a bound to the bundle of rays are obtained and it is determined whether the vector passes inside or outside of the silhouette edge. Results of determining, for each of the identified silhouette edges, whether the vector passes inside or outside of the silhouette edge, are used to determine an intersection testing result for the bundle of rays with respect to the box.

Abstract: Hierarchical acceleration structures with implicitly represented nodes are used for intersection testing in a ray tracing system. Nodes of the hierarchical acceleration structure each represents a region in a scene and are linked to form the hierarchical acceleration structure. Data is stored representing the hierarchical acceleration structure including data defining the regions represented by a plurality of the nodes of the hierarchical acceleration structure. At least one node of the hierarchical acceleration structure is an implicitly represented node, wherein data represented by an implicitly represented node is not explicitly included as part of the stored data but can be inferred from the stored data. Intersection testing in the ray tracing system is performed in which, based on conditions in the ray tracing system, a determination is made as to whether testing of one or more rays for intersection with a region represented by a particular node of a sub-tree is to be skipped.

Abstract: A floor cleaner including a base movable over a surface to be cleaned, a suction nozzle provided on the base having a suction inlet, a body portion having a fluid dispensing member selectively removable from the body portion, the body portion being pivotally mounted to the base movable between an upright storage position and an inclined floor cleaning position, a suction source in fluid communication with the suction nozzle, and a reservoir configured to provide solution. The fluid dispensing member includes a grip, a dispensing nozzle in fluid communication with the reservoir, and an actuator. The fluid dispensing member is configured to deliver solution from the reservoir through the dispensing nozzle upon user actuation of the actuator, independent of function of the base and body of the floor cleaner.

Abstract: Ray tracing systems and computer-implemented methods are described for performing intersection testing on a bundle of rays with respect to a box. Silhouette edges of the box are identified from the perspective of the bundle of rays. For each of the identified silhouette edges, components of a vector providing a bound to the bundle of rays are obtained and it is determined whether the vector passes inside or outside of the silhouette edge. Results of determining, for each of the identified silhouette edges, whether the vector passes inside or outside of the silhouette edge, are used to determine an intersection testing result for the bundle of rays with respect to the box.

Abstract: A medical implant device (100) is disclosed that can protect and shield an implant (101) as the implant (101) moves through body tissue. The medical implant device (100) can comprise a main body portion (110) having a payload opening (111) to receive a payload (i.e., an implant). The medical implant device (100) can also comprise a tapered nose portion (120) at a front end (103a) of the medical implant device (100) extending from the main body portion (110) and configured to penetrate body tissue. In addition, the medical implant device (100) can comprise a payload coupling interface (130) configured to couple the implant (101) to the main body portion (110).

Abstract: Hierarchical acceleration structures to be used for intersection testing in a ray tracing system are generated. Nodes of the hierarchical acceleration structure represent regions in a scene, and are linked to form the hierarchical acceleration structure. Data is stored representing the hierarchical acceleration structure defining the regions represented by a plurality of the nodes of the hierarchical acceleration structure. At least one node of the hierarchical acceleration structure is an implicitly represented node, wherein data defining a region represented by an implicitly represented node is not explicitly included as part of the stored data but can be inferred from said stored data. Ray tracing systems and computer-implemented methods perform intersection testing in the ray tracing system in which, based on conditions in the ray tracing system, a determination is made as to whether testing of one or more rays for intersection with a region represented by a particular node of a sub-tree is to be skipped.

Abstract: A method of converting 10-bit pixel data (e.g. 10:10:10:2 data) into 8-bit pixel data involves converting the 10-bit values to 7-bits or 8-bits and generating error values for each of the converted values. Two of the 8-bit output channels comprise a combination of a converted 7-bit value and one of the bits from the fourth input channel. A third 8-bit output channel comprises the converted 8-bit value and the fourth 8-bit output channel comprises the error values. In various examples, the bits of the error values may be interleaved when they are packed into the fourth output channel.

Abstract: Ray tracing systems and computer-implemented methods perform intersection testing on a bundle of rays with respect to a box. Silhouette edges of the box are identified from the perspective of the bundle of rays. For each of the identified silhouette edges, components of a vector providing a bound to the bundle of rays are obtained and it is determined whether the vector passes inside or outside of the silhouette edge. Results of determining, for each of the identified silhouette edges, whether the vector passes inside or outside of the silhouette edge, are used to determine an intersection testing result for the bundle of rays with respect to the box.

Abstract: Ray tracing systems and computer-implemented methods perform intersection testing on a bundle of rays with respect to a box. A bundle of rays to be tested for intersection with a box is received, and a first bundle intersection test is performed to determine whether or not all of the rays of the bundle intersect the box, wherein if the first bundle intersection test determines that all of the rays of the bundle intersect the box, an intersection testing result for the bundle with respect to the box is that all of the rays of the bundle intersect the box. If the first bundle intersection test does not determine that all of the rays of the bundle intersect the box, a second bundle intersection test is performed, which determines whether or not all of the rays of the bundle miss the box, the result of which is used to determine the intersection testing result for the bundle with respect to the box.

Abstract: A technology is described for determining an intended movement from neuromuscular signals. An example method (800) includes receiving electromyography (EMG) data corresponding to single-ended channels of an electrode array (810), where EMG signals are detected by electrodes comprising the single-ended channels of the electrode array and the EMG signals are converted to the EMG data. Determining differential channel pairs for the single-ended channels of the electrode array (820) and extracting feature data from the EMG data of the differential channel pairs (830). Thereafter a feature data set is selected from the feature data of the differential channel pairs (840) and the feature data set is input to a decode model configured to correlate the feature data set to an intended movement (850). Decode output is received from the decode model indicating the intended movement (860) and the decode output is provided to a device (870).

Abstract: Hierarchical acceleration structures with implicitly represented nodes are used for intersection testing in a ray tracing system. Nodes of the hierarchical acceleration structure each represents a region in a scene and are linked to form the hierarchical acceleration structure. Data is stored representing the hierarchical acceleration structure including data defining the regions represented by a plurality of the nodes of the hierarchical acceleration structure. At least one node of the hierarchical acceleration structure is an implicitly represented node, wherein data represented by an implicitly represented node is not explicitly included as part of the stored data but can be inferred from the stored data. Intersection testing in the ray tracing system is performed in which, based on conditions in the ray tracing system, a determination is made as to whether testing of one or more rays for intersection with a region represented by a particular node of a sub-tree is to be skipped.

Abstract: Hierarchical acceleration structures to be used for intersection testing in a ray tracing system are generated. Nodes of the hierarchical acceleration structure represent regions in a scene, and are linked to form the hierarchical acceleration structure. Data is stored representing the hierarchical acceleration structure defining the regions represented by a plurality of the nodes of the hierarchical acceleration structure. At least one node of the hierarchical acceleration structure is an implicitly represented node, wherein data defining a region represented by an implicitly represented node is not explicitly included as part of the stored data but can be inferred from said stored data. Ray tracing systems and computer-implemented methods perform intersection testing in the ray tracing system in which, based on conditions in the ray tracing system, a determination is made as to whether testing of one or more rays for intersection with a region represented by a particular node of a sub-tree is to be skipped.

Abstract: A hierarchical acceleration structure is generated for intersection testing in a ray tracing system. Nodes of the hierarchical acceleration structure are determined, wherein each of the nodes represents a region in a scene, and wherein the nodes are linked to form the hierarchical acceleration structure. Data is stored representing the hierarchical acceleration structure. The stored data defines the regions represented by a plurality of the nodes of the hierarchical acceleration structure. At least one node is an implicitly represented node, wherein data defining a region represented by an implicitly represented node is not explicitly included as part of the stored data but can be inferred from the stored data.