EP2879409A1 - Système et procédé de détermination d'ensemble approximatif d'objets visibles pour le traçage de faisceau - Google Patents

Système et procédé de détermination d'ensemble approximatif d'objets visibles pour le traçage de faisceau Download PDF

Info

Publication number
EP2879409A1
EP2879409A1 EP14003975.1A EP14003975A EP2879409A1 EP 2879409 A1 EP2879409 A1 EP 2879409A1 EP 14003975 A EP14003975 A EP 14003975A EP 2879409 A1 EP2879409 A1 EP 2879409A1
Authority
EP
European Patent Office
Prior art keywords
partial beams
triangle
beams
ray
triangles
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
EP14003975.1A
Other languages
German (de)
English (en)
Inventor
Bartosz Ziolko
Tomasz Pedzimaz
Szymon Palka
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Akademia Gomiczo Hutnicza
Original Assignee
Akademia Gomiczo Hutnicza
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Akademia Gomiczo Hutnicza filed Critical Akademia Gomiczo Hutnicza
Publication of EP2879409A1 publication Critical patent/EP2879409A1/fr
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04S—STEREOPHONIC SYSTEMS 
    • H04S7/00—Indicating arrangements; Control arrangements, e.g. balance control
    • H04S7/30—Control circuits for electronic adaptation of the sound field

Definitions

  • Embodiments of the invention generally relate to the field of beam tracing, in particular to sound tracing and thus simulating acoustic effects in real time.
  • AD-Frustum Adaptive Frustum Tracing for Interactive Sound Propagation; Anish Chandak, Christian Lauterbach, Micah Taylor, Zhimin Ren, Dinesh Manocha, Member, IEEE
  • hal.inria.fr/docs/00/50/99/81/PDF/CG98.pdf A Beam Tracing Method with Precise Antialiasing for Polyhedral Scenes; Djamchid GHAZANFARPOUR and Jean-Marc HASENFRATZ; Laboratoire MSI - liable de Limoges
  • a sound engine may determine a final sound at a listener location by emulating sound waves within a three-dimensional scene.
  • the sound engine may emulate sound waves by issuing rays from a location of a sound event and tracing the rays through the three-dimensional scene.
  • the rays may intersect objects within the three-dimensional scene which have sound modification factors.
  • the sound modification factors and other factors eg., distance traveled by the ray, angle of intersection with the object, etc. may be applied to the sound event to determine a final sound which is heard by the listener.
  • the aim of the present invention is a computer implemented method for determining visibility in beam tracing that would be more efficient in terms of computing resources and lead to decreased time of obtaining the required results and thus enable creating real-time soundtracer.
  • the object of the invention is a computer-implemented method for beam tracing, wherein a set of beams is a representation of a physical wave phenomenon, the method comprising the steps of: receiving information regarding a beam and potentially intersecting objects; executing beam-triangle intersection tests; discarding elements, for which an intersection test is negative; dividing the beam into smaller partial beams; providing data for parallel processing; discarding of triangles with respect to partial beams; dividing the partial beams into smaller partial beams; approximating the smaller partial beams with rays; for each ray, finding the closest triangle, if such a triangle exists; creating delimited smaller partial beams; selectively applying merging of smaller partial beams previously delimited.
  • Another object of the invention is a system for beam tracing, wherein a set of beams is a representation of a physical wave phenomenon, the system comprising: a hierarchical model memory for storing a scene representation; a dedicated signal processor for performing intersection tests of ray-triangle and beam-triangle type; a controller, coupled via a bus to the processor, configured to execute the steps of: receiving, via an I/O controller, information regarding a beam and potentially intersecting objects; executing beam-triangle intersection tests; discarding elements, for which an intersection test is negative; dividing the beam into smaller partial beams; providing data for parallel processing; discarding of triangles with respect to partial beams; dividing the partial beams into smaller partial beams; approximating the smaller partial beams with rays; for each ray finding the closest triangle if such a triangle exists; creating delimited smaller partial beams; selectively applying merging of smaller partial beams previously delimited.
  • Another object of the invention is a computer readable non-transitory storage medium storing computer-executable instructions performing all the steps of the computer-implemented method according to the invention when executed on a computer.
  • the information regarding potentially intersecting objects is input as a hierarchical or not hierarchical representation of a scene composed of objects, preferably a scene tree.
  • the method further comprises providing data for parallel processing partial beams and respective triangles in relation to the partial beams.
  • the discarding of triangles with respect to partial beams is executed based on a result of a test on intersecting with the partial beams and those for which the intersection test is negative are discarded.
  • the step of creating delimited smaller partial beams involves delimiting the beams with an object, which is located closest to the beginning of a ray approximating this particular smaller partial beam.
  • the object located closest to the beginning of a ray approximating this particular smaller partial beam is determined based on a ray-triangle intersection test.
  • the ray-triangle intersection test is the Ingo Wald's test.
  • the ray-triangle intersection tests are executed in parallel with a use of SSE or AVX instructions.
  • the merging of smaller partial beams is executed for smaller partial beams delimited by matching triangles.
  • the matching triangles are the same triangle or two different triangles located on the same plane and having the same material, or triangles located in planes having similar normal or having acoustic material of similar characteristics.
  • the set of beams is a representation of a sound wave.
  • these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated in a computer system.
  • these signals are referred to as bits, packets, messages, values, elements, symbols, characters, terms, numbers, or the like.
  • a beam is considered herein to be a three dimensional object having a base that is a polygon (frequently located on a plane), having a defined range and edge vectors originating from vertices of the base (all such vectors should be directed at one half plane).
  • edge vectors If extension of the edge vectors intersects at a certain point this point is called an apex.
  • apex For example in case of a beam having a quadrangle base, two of the four vectors may intersect at one point and the other two in a second point. In such a case the beam virtually starts at the edge.
  • the most suitable bases are a triangle and a quadrangle, however, the present method may be applied to any polygon.
  • a beam having a quadrangle base is frequently called a frustum.
  • the present invention is a new method called Adaptive Ray-Frustum created after iterative attempts to extend the Adaptive Frustum algorithm and testing how this extensions impact performance.
  • the method is based on an observation that it is advantageous to replace the small number of complex tests with an increased number of much simpler tests.
  • most of the quadtree structure used to manage beam subdivision in the Adaptive Frustum algorithm reaches the maximum level of subdivision after addition of a low number of triangles. It turns out, that in many cases the number of simple tests used in Adaptive Ray-Frustum can be lower than the number of complex tests in Adaptive Frustum.
  • the method according to the present invention is based on an assumption that a sufficiently small beam can be approximated with a ray. For example, as mentioned earlier, objects in a scene used for the simulation of sound are much less complex than the corresponding graphic objects in scenes. This means that when a beam of a small size is approximated with a ray, the likelihood of error is low. In addition, most of the beams are fully obstructed or not obstructed at all.
  • the present invention introduces execution of up to 4 k simpler tests and 4 p -1 complex beam-triangle tests.
  • An appropriate selection of p and k parameters allows for significant increase of processing speed and thereby significantly reduces execution time.
  • Subdivision of a beam into parts is performed to allow binary determination whether a triangle intersects with appropriately small part of the beam or not. When an intersection occurs, it is assumed that a part of the triangle intersecting the beam, fully obstructs it. Indeed, this is true only for a very small beams.
  • the difference between a large and a small beam lies in its appropriate division taking into account a given scene.
  • a division allowing to detect many triangles achieves a small beam while a division which does not allow to detect many objects in a scene results in a large beam.
  • This is a quantitative approach. For example assuming there is a one point source of sound and 6 beams are emitted from the source, each originating at a different wall of a hexagon defined on the source.
  • the beams are not split into partial beams, for each there may be detected 1 wall, which means that the sound may reflect from at most 6 different walls. If each beam is divided one time, there will be 24 partial beams which implies that the number of objects the sound may reflect off is at most 24. In case of two times division, there are up to 96 detected objects and in case of three times division there are up to 384 objects, while in case of four times division, there are up to 1536 objects detected.
  • a large beam means a beam insufficiently divided with respect to the scene, that is not capable of detecting numerous objects (triangles).
  • This problem is partially depicted in Fig. 1C , where a large triangle is not detected at all because the beam has not been divided and the ray has missed the triangle.
  • the smaller triangle obstructs the large triangle and because the division of the beam is insufficient (large beam) it will not detect the large triangle.
  • the above descriptive definition may also be quantitatively defined with an equation i.e. the method does not detect objects smaller than (2 ⁇ (p-1))/h, wherein h is a distance to a given object and p is the number of divisions. For example: in case of a four times division and objects 10 meters away, the resolution of the method is 1.25 meter and only object larger than this number will certainly be detected. Smaller objects have only a certain probability of detection but there will never be a certainty.
  • Adaptive Frustum algorithm performance tests show that its computationally most expensive part is the intersections tests. Such a test is executed frequently and each of its execution requires not only a lot of calculations, but also loading into a memory information about given sub-beam.
  • Fig. 1 presents a set of four cases depicting use of a ray - triangle approach.
  • Case (a) presents a ray (101), approximating a beam (102), which starts at the beam's starting plane (103).
  • Case (b) presents a ray intersecting with a triangle (104).
  • the triangle (104) is thereby classified as intersecting with the beam.
  • Case (c) presents a large triangle (105) that intersects with the beam but the ray (101) approximating the beam does not intersect with the triangle (105). As a result, the triangle (105) is erroneously classified as not intersecting with the beam.
  • Case (d) presents two triangles (104, 106) intersecting with the beam (102).
  • the approximating ray (101) intersects with both triangles, whereas the smaller triangle (106) is closer to the beginning of the ray.
  • the smaller triangle (106) is classified as covering the whole plane of the beam (102) although the larger triangle (104) is a better candidate.
  • a solution of the problem of large beams approximation with a ray is a uniform division of the beam into a predefined number of sections and approximation of each of these sections with a separate ray as shown in Fig. 2 .
  • Figure 2 shows, as case (a), a possible approximation of a beam with four rays. This approach allows for four times higher accuracy. It means that without division there could be one triangle detected of those that intersect with the beam. Division into four partial beams allows to detect four triangles. Further division will increase accuracy but also increase the computational effort.
  • Case (b) shows an approximation of a beam with sixteen rays, equivalent to a threefold division of the beam.
  • AVX Advanced Vector Extensions
  • AVX differs from the SSE mainly in that AVX executes two times more computations during data processing.
  • a compatible triangle is the same triangle or two different triangles located on the same plane and having the same material, or triangles located in planes having similar normal and plane constant and having acoustic material of similar characteristics.
  • Algorithms operating directly on beams and operating only on rays have major weaknesses. The first of them is constrained by the requirement for costly tests, but the hierarchical processing allows fast rejection of triangles. The second algorithm allows for much faster processing of a single triangle, but the number of verified triangles is too high.
  • Another improvement of the aforementioned method is to use p-times division of the beam with application of the "beam-triangle" test for discarding the highest number of triangles. After execution of this step, a given section of the beam is divided k-p times and the obtained sections are approximated with rays.
  • the test is based on the use of pre-calculated values for calculating barycentric coordinates of a point of intersection of a ray with the plane of a triangle. This algorithm is well suited to implementation using vector instructions, where several rays are tested at the same time in terms of existence of an intersection with a single triangle.
  • Fig. 4 presents that partial beams are approximated with a certain number of rays. Thereafter for each triangle that intersects with a given partial beam there are executed intersections with rays that approximate such partial beam. This is the moment when an intersection test, such as Ingo Wald's test, is required. This may be any intersection test such as Plucker coordinates test defined by Moller-Trumbore or other (such as
  • intersection of a plurality of triangles with one ray may be implemented intersection of a plurality of triangles with one ray and acceleration of intersection of a single ray with a single triangle.
  • Use of AVX and/or SSE and test of a plurality of rays at one time have proven most efficient on typical CPUs but other versions may be more efficient on other platforms or be easier to implement in designated hardware.
  • the Adaptive Ray-Frustum Algorithm uses two levels of triangles processing in order to reduce the number of "ray-triangle" tests made in its last phase.
  • the first level of processing is to discard these triangles, which certainly do not intersect with the beam or one of its parts.
  • a scene tree is used to provide approximate set of triangles intersecting the beam.
  • object can be defined as a hierarchical or non hierarchical structure and can provide spatial partitioning of the scene.
  • the second level of processing in the Adaptive Ray-Frustum algorithm is a k-p fold division of the beam into parts and approximation of each part with a ray. For each of the triangles obtained from the first level, there is executed an intersection test with all rays approximating that part of the beam.
  • each ray is described by a triangle, which intersects with this ray and a distance to the intersection point. If the tested triangle is closer than the recorded in the current state of the ray and the intersection test is positive, the state of the ray is updated.
  • the last step of the algorithm is to attempt merging of matching beams in order to reduce the number of beams stored in the algorithm.
  • the aforementioned method may be formulated in pseudocode as the following three methods:
  • the process of finding the closest triangle may be as simple as scanning through the list of objects and selecting the one that intersects with a ray and the distance from the source of the ray to the intersection point is minimal (at this point the ray-triangle intersection test is applied).
  • Matching parts are considered parts that are adjacent and are limited by the same triangle or a triangle having the same material and positioned in the same plane.
  • Sweep algorithm is used to browse the grid of partial beams and to find areas, which, are limited by the matching triangles (matching partial beams are limited by matching triangles). Such areas are then merged in order to reduce the number of beams to be processed in the algorithm for tracking beams.
  • Figure 3 presents the process of Adaptive Ray-Frustum.
  • step 301 there is received information regarding a sound beam and potentially intersecting objects (using a scene tree).
  • this step corresponds to line 1.
  • step 302 there are executed "beam-triangle" intersection tests.
  • this step corresponds to line 2. Those elements, for which an intersection test is negative are discarded at step 303.
  • the procedure advances at step 304 to divide the beam into smaller partial beams.
  • this step corresponds to lines 3-4.
  • step 305 there is provided data for parallel processing - for example two partial beams and respective triangles to further processing in relation to the partial beams.
  • this step corresponds to lines 3-4.
  • step 306 there is executed discarding of triangles with respect to partial beams.
  • the scene elements are verified against intersecting with the partial beams. Those for which the intersection test is negative are discarded.
  • this step corresponds to line 2.
  • step 307 the partial beams are divided into smaller partial beams.
  • this step corresponds to line 1.
  • step 308 the partial beams of step 307 are approximated with rays.
  • this step corresponds to line 2.
  • step 309 for each ray there is found the closest triangle if such a triangle exists.
  • this step corresponds to line 3.
  • step 310 there are created delimited partial beams.
  • Each ray from the previous step corresponds to a single partial beam.
  • the partial beam is delimited by an object, which is located closest to the beginning of a ray approximating this particular partial beam of step 307.
  • this step corresponds to line 4.
  • the final step of the method 311 is to selectively apply merging of partial beams previously delimited. This step is executed in order to limit the result of the processing. In the Adaptive Ray-Frustum Method presented earlier in pseudocode, this step corresponds to line 6.
  • Figures 4A - 4I present the method according to the present invention on an exemplary scene.
  • the scene comprises a single beam and five obstacles P1-P5 as shown in Fig. 4A also comprising one beam.
  • Fig. 4B presents a result of executing method steps 302, 303 that is the whole P5 and part of P1 objects are discarded as non-intersecting with the main, initial beam.
  • Fig. 4C presents the result of step 304 of the method wherein in this example the beam is divided into two partial beams.
  • Fig. 4D presents the result of step 305 and 306 of the method. Data for parallel processing of the left partial beam and the right partial beam are provided and objects are discarded with respect to the previously defined partial beams.
  • Fig. 4E presents further division of the left partial beam and the right partial beam in line with the step 307 of the method.
  • Fig. 4F presents step 308 of the method where partial beams are approximated with rays.
  • Fig. 4G presents step 309 of the method where the closest triangles are found for respective beams.
  • Fig. 4H presents step 310 of the method and the resulting delimited partial beams (not rays as at this stage the processing of partial beams is resumed).
  • Fig. 4I presents the final result of step 311 with partial beam merging applied.
  • Merging of partial beams of P2 was not possible because the walls of the P2 object delimiting the partial beams are located in different planes.
  • a comparison of the result of the method with an ideal result allows to determine that an appropriate selection of coefficients allows for obtaining an acceptable approximations of a precise result.
  • the phase of merging partial beams allows in this case to decrease the number of final partial beams from 8 to 7. In practice there are frequently situations, in which the number of final beams decreases multiple times after the use of merging algorithm.
  • Fig. 4 All the examples of Fig. 4 have been depicted in a two dimensional case.
  • the objects shown are pillars in the three dimensional space (a front view instead of top view as in Fig. 4 .
  • Each edge of a perspective view of the pillar is in 3D represented by two triangles.
  • Fig. 5 presents a block diagram of a system according to the present invention.
  • the system 501 according to the present invention may be also built as a dedicated hardware module, which will perform analogous role to existing GPU units.
  • a module may be split into two core parts: a hierarchical model memory 507 for storing a beam and a scene tree and a dedicated signal processor 505 for performing intersection tests (both: ray-triangle and beam-triangle).
  • the module can also be a part of hardware performing real-time sound tracing, which by using a scene representation, sources and receiver positions could render sound in a similar way to which GPU (Graphics Processing Unit) is used to render graphics.
  • GPU Graphics Processing Unit
  • controller 502 for executing the steps of the aforementioned method for sound tracing in cooperation with an I/O controller 506, a memory 503.
  • the inner circuits will consist of hardware implementation of the aforementioned algorithms. In order to perform transformation from software to hardware one can use existing industry standard solutions like VHDL language.
  • the invention may also be implemented in a form of a dedicated hardware module, preferably an extension card, that will detect objects.
  • This dedicated hardware module may be connected with other modules to create complete beam tracing or sound rendering module.
  • a processor of such extension card comprises a set of multithread logical units that using vector instructions process in parallel independent sets of tests of beam-triangle intersection.
  • Such processor also comprises a set of multithread logical units that using vector instructions process, in parallel, independent sets of tests of ray-triangle intersection.
  • the extension card also comprises a dedicated dispatcher circuit for assigning sets of tests to idle logical units.
  • the extension card also comprises a memory having a hierarchical model for storing a scene model.
  • the hierarchical model memory is connected via a bus to the processors.
  • a read/write buffer may comprise rays in a form of normalized directional vectors.
  • a scene tree is loaded into the hierarchical model memory at an initialization stage.
  • Software using the extension card sends to the card a set of beams, for which visible objects have to be found. In response the software receives triangles intersecting with different rays into which the beam was divided.
  • Such extension card may be implemented in System on Chip technology (SoC) and may be a dedicated hardware for video gaming machines or computers or for other multimedia and wave phenomena simmulation purposes.
  • SoC System on Chip technology
  • a hardware implementation increases efficiency, which is an advantage as performance in gaming environments is always a priority.
  • the described algorithm significantly speeds up processing in applications for tracing beams in order to simulate the propagation of sound and other applications where beam tracing can be used.
  • the use of a hybrid combination of processing beams and processing of rays eliminates the weaknesses of the Adaptive Frustum algorithm.
  • the resulting method for finding objects limiting the beam is much simpler to implement and allows the use of a more efficient algorithm for merging the beams. There has been gained a significant improvement in efficiency, while at the same time reducing the number of output beams.
  • the first algorithm allows for quick discarding of triangles out of range and the other uses simple tests.
  • the present solution allows for execution of some complex discarding tests and then execute as a set of quick simple tests on rays.
  • the present method due to multi-pass structure first extracts, from the scene tree, cells intersecting with the beam and from these cells extracts triangles subsequently passed to a discarding and beam division algorithm executed for a given time in order to finally approximate partial beams with rays and the remaining triangles are intersected with these rays.
  • subsequent phases may be combined, for example extracting cells from the scene tree and obtaining triangles from them.
  • a different embodiment of the present invention may instead of emitting from the source/emitter beams in all directions, emit a predefined number of rays and perform reflections from full triangles (one time for each triangle):
  • the aforementioned method for sound tracing may be performed and/or controlled by one or more computer programs.
  • Such computer programs are typically executed by utilizing the computing resources in a computing device such as personal computers, personal digital assistants, cellular telephones, receivers and decoders of digital television or the like.
  • Applications are stored on a non-transitory medium.
  • An example of a non-transitory medium is a non-volatile memory, for example a flash memory or volatile memory, for example RAM.
  • the computer instructions and are executed by a processor.
  • These memories are exemplary recording media for storing computer programs comprising computer-executable instructions performing all the steps of the computer-implemented method according the technical concept presented herein.
  • the aforementioned method for beam tracing in particular sound tracing, may be performed for simulating other physical wave phenomena like light, radio waves or shock waves.
  • the method can be used in multimedia and simulation systems other than sound tracer.

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Acoustics & Sound (AREA)
  • Signal Processing (AREA)
  • Image Generation (AREA)
EP14003975.1A 2013-11-27 2014-11-26 Système et procédé de détermination d'ensemble approximatif d'objets visibles pour le traçage de faisceau Ceased EP2879409A1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CA2835490A CA2835490A1 (fr) 2013-11-27 2013-11-27 Systeme et procede permettant de determiner un ensemble approximatif d'objets visibles en matiere de tracage par faisceau

Publications (1)

Publication Number Publication Date
EP2879409A1 true EP2879409A1 (fr) 2015-06-03

Family

ID=52133760

Family Applications (1)

Application Number Title Priority Date Filing Date
EP14003975.1A Ceased EP2879409A1 (fr) 2013-11-27 2014-11-26 Système et procédé de détermination d'ensemble approximatif d'objets visibles pour le traçage de faisceau

Country Status (2)

Country Link
EP (1) EP2879409A1 (fr)
CA (1) CA2835490A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017052955A1 (fr) * 2015-09-25 2017-03-30 Intel Corporation Optimisation des opérations de troncature dans des moteurs de rendu à pavés décalés uniquement en position de nuançage
GB2578604A (en) * 2018-10-31 2020-05-20 Nokia Technologies Oy Determination of spatial audio parameter encoding and associated decoding

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080043018A1 (en) * 2000-06-19 2008-02-21 Alexander Keller Instant ray tracing
US20100060634A1 (en) * 2006-07-21 2010-03-11 Ingo Wald Ray tracing a three-dimensional scene using a hierarchical data structure
US20110043521A1 (en) * 2009-08-18 2011-02-24 Dreamworks Animation Llc Ray-aggregation for ray-tracing during rendering of imagery
US20110316855A1 (en) * 2010-06-24 2011-12-29 International Business Machines Corporation Parallelized Streaming Accelerated Data Structure Generation
US8139780B2 (en) 2007-03-20 2012-03-20 International Business Machines Corporation Using ray tracing for real time audio synthesis

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080043018A1 (en) * 2000-06-19 2008-02-21 Alexander Keller Instant ray tracing
US20100060634A1 (en) * 2006-07-21 2010-03-11 Ingo Wald Ray tracing a three-dimensional scene using a hierarchical data structure
US8139780B2 (en) 2007-03-20 2012-03-20 International Business Machines Corporation Using ray tracing for real time audio synthesis
US20110043521A1 (en) * 2009-08-18 2011-02-24 Dreamworks Animation Llc Ray-aggregation for ray-tracing during rendering of imagery
US20110316855A1 (en) * 2010-06-24 2011-12-29 International Business Machines Corporation Parallelized Streaming Accelerated Data Structure Generation

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
ANISH CHANDAK; CHRISTIAN LAUTERBACH; MICAH TAYLOR; ZHIMIN REN; DINESH MANOCHA: "Member", 21 October 2007, IEEE, article "AD-Frustum: Adaptive Frustum Tracing for Interactive Sound Propagation", XP002738046 *
ANISH CHANDAK; CHRISTIAN LAUTERBACH; MICAH TAYLOR; ZHIMIN REN; DINESH MANOCHA: "Member", IEEE, article "AD-Frustum: Adaptive Frustum Tracing for Interactive Sound Propagation"
CHRISTIAN LAUTERBACH; ANISH CHANDAK; DINESH MANOCHA: "Interactive Sound Rendering in Complex and Dynamic Scenes using Frustum Tracing", IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, vol. 13, no. 6, November 2007 (2007-11-01)
MOLLER TOMAS; TRUMBORE BEN: "Fast, minimum storage ray-triangle intersection", JOURNAL OF GRAPHICS TOOLS, vol. 2, no. 1, 1997, pages 21 - 28, XP055297284, DOI: doi:10.1080/10867651.1997.10487468
SHEVTSOV MAXIM; SOUPIKOV ALEXEI; KAPUS ALEXANDER: "Ray-Triangle Intersection Algorithm for Modern CPU Architectures", PROCEEDINGS OF GRAPHICON'2007 CONFERENCE, 2007
WALD INGO: "PhD Thesis", 2004, SAARBRUCKEN : MAX-PLANCK-INSTITUT FUR INFORMATIK, article "Realtime Ray Tracing and Interactive Global Illumination"

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017052955A1 (fr) * 2015-09-25 2017-03-30 Intel Corporation Optimisation des opérations de troncature dans des moteurs de rendu à pavés décalés uniquement en position de nuançage
US9846962B2 (en) 2015-09-25 2017-12-19 Intel Corporation Optimizing clipping operations in position only shading tile deferred renderers
GB2578604A (en) * 2018-10-31 2020-05-20 Nokia Technologies Oy Determination of spatial audio parameter encoding and associated decoding

Also Published As

Publication number Publication date
CA2835490A1 (fr) 2015-05-27

Similar Documents

Publication Publication Date Title
US11200724B2 (en) Texture processor based ray tracing acceleration method and system
US8390618B2 (en) Technique for improving ray tracing performance
US11715255B2 (en) Intersection testing in a ray tracing system using ray bundle vectors
US11790480B2 (en) Tiling a primitive in a graphics processing system by edge-specific testing of a subset of tiles in a rendering space
KR101705072B1 (ko) 영상 처리 장치 및 방법
US20210304489A1 (en) Graphics processing
US10242482B2 (en) Tiling a primitive in a graphics processing system
JP2023532434A (ja) レイトレーシングのための早期カリング
US20170109462A1 (en) System and a method for determining approximate set of visible objects in beam tracing
US20150146877A1 (en) System and a method for determining approximate set of visible objects in beam tracing
KR20110032366A (ko) 영상 처리 장치 및 방법
EP2879409A1 (fr) Système et procédé de détermination d'ensemble approximatif d'objets visibles pour le traçage de faisceau
US9715758B2 (en) Image processing apparatus and method using virtual point light (VPL) information
EP2827302B1 (fr) Appareil et procédé de traitement d'image
JP2015108703A (ja) ビームトレーシングで可視オブジェクトの近似セットを決定するシステム及び方法
US11682160B2 (en) Intersection testing in a ray tracing system using multiple ray bundle intersection tests
US11928770B2 (en) BVH node ordering for efficient ray tracing
EP4254340A1 (fr) Réduction de rendu redondant dans un système graphique
US20230043630A1 (en) Graphics processing systems
CN117607897A (zh) 基于光线投影法的动态物体去除方法及相关装置

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20141126

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

R17P Request for examination filed (corrected)

Effective date: 20141217

17Q First examination report despatched

Effective date: 20160314

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN REFUSED

18R Application refused

Effective date: 20180123