FAST RENDERING OF QUADRICS
Described embodiments include an apparatus that includes a display, including a screen, and a processor. The processor is configured to define a bounding region on the screen. The processor is further configured to render a quadric, which is defined in a parameter space, over a three-dimensional electroanatomical map of a surface of a heart that is displayed on the screen, by, for each pixel in the bounding region, transforming, to the parameter space, a virtual ray that passes through the pixel, ascertaining whether a point of intersection between the transformed virtual ray and the quadric exists in the parameter space, and, subsequently, provided the point of intersection exists, rendering the pixel on the screen, based on properties of the point of intersection. Other embodiments are also described.
1 . Apparatus, comprising:
a display, comprising a screen; and
a processor, configured:
to define a bounding region on the screen, and
to render a quadric, which is defined in a parameter space, over a three-dimensional electroanatomical map of a surface of a heart that is displayed on the screen, by, for each pixel in the bounding region:
transforming, to the parameter space, a virtual ray that passes through the pixel,
ascertaining whether a point of intersection between the transformed virtual ray and the quadric exists in the parameter space, and
subsequently, provided the point of intersection exists, rendering the pixel on the screen, based on properties of the point of intersection.
2 . The apparatus according to claim 1 , wherein the processor is further configured to define the quadric, in the parameter space, such that the quadric is bounded by a cube having eight corners, two of which are at (−1,−1,−1) and (1,1,1), respectively.
3 . The apparatus according to claim 2 , wherein the processor is configured to define the bounding region by:
transforming the corners of the cube to a screen space, which is defined in terms of a coordinate system of the screen, and
defining the bounding region such that the bounding region is a minimum bounding rectangle of the transformed corners.
4 . The apparatus according to claim 1 , wherein the processor is further configured to define the quadric such that the quadric is representable by a 4×4 diagonal matrix Q.
5 . The apparatus according to claim 4 ,
wherein the virtual ray has a ray origin O and a ray-direction vector D,
wherein the processor is configured to transform the virtual ray by computing O′, which is the ray origin O transformed to the parameter space, and D′, which is the ray-direction vector D transformed to the parameter space, and
wherein the processor is configured to ascertain whether the point of intersection exists by attempting to compute the point of intersection, by:
computing a first coefficient a=D′ T QD′, where D′ T is a transpose of D′, a second coefficient b=2D′ T QO′, and a third coefficient c=O′QO′, and
subsequently, solving, for a parameter t, at 2 +bt+c=0.
6 . The apparatus according to claim 5 , wherein the processor is further configured to represent Q as a four-element vector Q D , and wherein the processor is configured to compute each of the first coefficient a, the second coefficient b, and the third coefficient c by performing an element-wise multiplication of Q D .
7 . The apparatus according to claim 1 , wherein the processor is further configured to receive a signal that indicates a location of a distal end of an intrabody catheter, and wherein the processor is configured to render the quadric over a portion of the three-dimensional electroanatomical map that corresponds to the indicated location.
8 . The apparatus according to claim 7 , wherein the processor is configured to render the quadric in response to an ablating signal being passed into the surface of the heart, by the distal end of the intrabody catheter, at the indicated location.
9 . The apparatus according to claim 1 , wherein the processor is configured to render the pixel on the screen by:
computing a normal vector to the quadric at the point of intersection, and
rendering the pixel, based on a coloring of the quadric at the point of intersection, and the normal vector.
10 . A method, comprising:
using a processor, defining a bounding region on a screen; and
rendering a quadric, which is defined in a parameter space, over a three-dimensional electroanatomical map of a surface of a heart that is displayed on the screen, by, for each pixel in the bounding region:
transforming, to the parameter space, a virtual ray that passes through the pixel,
ascertaining whether a point of intersection between the transformed virtual ray and the quadric exists in the parameter space, and
subsequently, provided the point of intersection exists, rendering the pixel on the screen, based on properties of the point of intersection.
11 . The method according to claim 10 , further comprising defining the quadric, in the parameter space, such that the quadric is bounded by a cube having eight corners, two of which are at (−1,−1,−1) and (1,1,1), respectively.
12 . The method according to claim 11 , wherein defining the bounding region comprises:
transforming the corners of the cube to a screen space, which is defined in terms of a coordinate system of the screen, and
defining the bounding region such that the bounding region is a minimum bounding rectangle of the transformed corners.
13 . The method according to claim 10 , further comprising defining the quadric such that the quadric is representable by a 4×4 diagonal matrix Q.
14 . The method according to claim 13 ,
wherein the virtual ray has a ray origin O and a ray-direction vector D,
wherein transforming the virtual ray comprises transforming the virtual ray by computing O′, which is the ray origin O transformed to the parameter space, and D′, which is the ray-direction vector D transformed to the parameter space, and
wherein ascertaining whether the point of intersection exists comprises attempting to compute the point of intersection, by:
computing a first coefficient a=D′ T QD′, where D′ T is a transpose of D′, a second coefficient b=2D′ T QO′, and a third coefficient c=O′QO′, and
subsequently, solving, for a parameter t, at 2 +bt+c=0.
15 . The method according to claim 14 , further comprising representing Q as a four-element vector Q D , wherein computing the first coefficient a, the second coefficient b, and the third coefficient c comprises computing each of the first coefficient a, the second coefficient b, and the third coefficient c by performing an element-wise multiplication of Q D .
16 . The method according to claim 10 , further comprising receiving a signal that indicates a location of a distal end of an intrabody catheter, wherein rendering the quadric comprises rendering the quadric over a portion of the three-dimensional electroanatomical map that corresponds to the indicated location.
17 . The method according to claim 16 , wherein rendering the quadric comprises rendering the quadric in response to an ablating signal being passed into the surface of the heart, by the distal end of the intrabody catheter, at the indicated location.
18 . The method according to claim 10 , wherein rendering the pixel on the screen comprises:
computing a normal vector to the quadric at the point of intersection, and
rendering the pixel, based on a coloring of the quadric at the point of intersection, and the normal vector.
19 . A computer software product comprising a tangible non-transitory computer-readable medium in which program instructions are stored, which instructions, when read by a processor, cause the processor:
to define a bounding region on a screen, and
to render a quadric, which is defined in a parameter space, over a three-dimensional electroanatomical map of a surface of a heart that is displayed on the screen, by, for each pixel in the bounding region:
transforming, to the parameter space, a virtual ray that passes through the pixel,
ascertaining whether a point of intersection between the transformed virtual ray and the quadric exists in the parameter space, and
subsequently, provided the point of intersection exists, rendering the pixel on the screen, based on properties of the point of intersection.
20 . The computer software product according to claim 19 , wherein the instructions further cause the processor:
to compute a normal vector to the quadric at the point of intersection, and
to render the pixel, based on a coloring of the quadric at the point of intersection, and the normal vector.