Highly Parallel Fast KD-tree Construction for Interactive Ray Tracing of Dynamic Scenes
We present a highly parallel, linearly scalable technique of kd‐tree construction for ray tracing of dynamic geometry. We use conventional kd‐tree compatible with the high performing algorithms such as MLRTA or frustum tracing. Proposed technique offers exceptional construction speed maintaining rea...
Gespeichert in:
| Veröffentlicht in: | Computer graphics forum 2007-09, Vol.26 (3), p.395-404 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 404 |
|---|---|
| container_issue | 3 |
| container_start_page | 395 |
| container_title | Computer graphics forum |
| container_volume | 26 |
| creator | Shevtsov, Maxim Soupikov, Alexei Kapustin, Alexander |
| description | We present a highly parallel, linearly scalable technique of kd‐tree construction for ray tracing of dynamic geometry. We use conventional kd‐tree compatible with the high performing algorithms such as MLRTA or frustum tracing. Proposed technique offers exceptional construction speed maintaining reasonable kd‐tree quality for rendering stage. The algorithm builds a kd‐tree from scratch each frame, thus prior knowledge of motion /deformation or motion constraints are not required. We achieve nearly real‐time performance of 7‐12 FPS for models with 200K of dynamic triangles at 1024x1024 resolution with shadows and textures. |
| doi_str_mv | 10.1111/j.1467-8659.2007.01062.x |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_30950492</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>30946298</sourcerecordid><originalsourceid>FETCH-LOGICAL-c5562-15e3625bf29fcf22594f2baccba62ddb7d1091ba5c0907bebbbed46dfb267d803</originalsourceid><addsrcrecordid>eNqNkU1v1DAQhi0EEkvhP1gcuCWMndjeHDjAlt1-qSBYKOJi2c64ZMkmxc7Szb-vw1Y9cKovnpGfZyTPSwhlkLN03m5yVkqVzaWocg6gcmAgeb5_QmYPD0_JDFiqFQjxnLyIcQMApZJiRq5Omutf7Ug_m2DaFlu6NHGg58fZEBDpou_iEHZuaPqO-j7Q027AYFL_F-kXM9J1aprumvaeHo-d2TaOfnXYYXxJnnnTRnx1fx-Rb8uP68VJdvFpdbp4f5E5ISTPmMBCcmE9r7zznIuq9Nwa56yRvK6tqhlUzBrhoAJl0VqLdSlrb7lU9RyKI_LmMPcm9H92GAe9baLDtjUd9ruoC6gElBV_DFhKXs0T-Po_cNPvQpc-oVlCRCkLlqD5AXKhjzGg1zeh2ZowagZ6ykVv9LR-Pa1fT7nof7nofVLfHdTbpsXx0Z5erJZTlfzs4DdxwP2Db8JvLVWhhL66XOmzHz_l9w_rtV4Vd5O_oug</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>194654631</pqid></control><display><type>article</type><title>Highly Parallel Fast KD-tree Construction for Interactive Ray Tracing of Dynamic Scenes</title><source>Business Source Complete</source><source>Wiley Blackwell Single Titles</source><creator>Shevtsov, Maxim ; Soupikov, Alexei ; Kapustin, Alexander</creator><creatorcontrib>Shevtsov, Maxim ; Soupikov, Alexei ; Kapustin, Alexander</creatorcontrib><description>We present a highly parallel, linearly scalable technique of kd‐tree construction for ray tracing of dynamic geometry. We use conventional kd‐tree compatible with the high performing algorithms such as MLRTA or frustum tracing. Proposed technique offers exceptional construction speed maintaining reasonable kd‐tree quality for rendering stage. The algorithm builds a kd‐tree from scratch each frame, thus prior knowledge of motion /deformation or motion constraints are not required. We achieve nearly real‐time performance of 7‐12 FPS for models with 200K of dynamic triangles at 1024x1024 resolution with shadows and textures.</description><identifier>ISSN: 0167-7055</identifier><identifier>EISSN: 1467-8659</identifier><identifier>DOI: 10.1111/j.1467-8659.2007.01062.x</identifier><language>eng</language><publisher>Oxford, UK: Blackwell Publishing Ltd</publisher><subject>Algorithms ; Color ; Computer graphics ; I.3.1 [Hardware Architecture]: Parallel processing ; I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism: Ray tracing ; I.3.7 [Computer Graphics]: Three‐Dimensional Graphics and Realism: Ray tracing; Color; Shading; Shadowing and texture ; Shading ; Shadowing and texture ; Studies</subject><ispartof>Computer graphics forum, 2007-09, Vol.26 (3), p.395-404</ispartof><rights>2007 The Author(s) Journal compilation © 2007 The Eurographics Association and Blackwell Publishing Ltd.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c5562-15e3625bf29fcf22594f2baccba62ddb7d1091ba5c0907bebbbed46dfb267d803</citedby><cites>FETCH-LOGICAL-c5562-15e3625bf29fcf22594f2baccba62ddb7d1091ba5c0907bebbbed46dfb267d803</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1111%2Fj.1467-8659.2007.01062.x$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1111%2Fj.1467-8659.2007.01062.x$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,780,784,1417,27924,27925,45574,45575</link.rule.ids></links><search><creatorcontrib>Shevtsov, Maxim</creatorcontrib><creatorcontrib>Soupikov, Alexei</creatorcontrib><creatorcontrib>Kapustin, Alexander</creatorcontrib><title>Highly Parallel Fast KD-tree Construction for Interactive Ray Tracing of Dynamic Scenes</title><title>Computer graphics forum</title><description>We present a highly parallel, linearly scalable technique of kd‐tree construction for ray tracing of dynamic geometry. We use conventional kd‐tree compatible with the high performing algorithms such as MLRTA or frustum tracing. Proposed technique offers exceptional construction speed maintaining reasonable kd‐tree quality for rendering stage. The algorithm builds a kd‐tree from scratch each frame, thus prior knowledge of motion /deformation or motion constraints are not required. We achieve nearly real‐time performance of 7‐12 FPS for models with 200K of dynamic triangles at 1024x1024 resolution with shadows and textures.</description><subject>Algorithms</subject><subject>Color</subject><subject>Computer graphics</subject><subject>I.3.1 [Hardware Architecture]: Parallel processing</subject><subject>I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism: Ray tracing</subject><subject>I.3.7 [Computer Graphics]: Three‐Dimensional Graphics and Realism: Ray tracing; Color; Shading; Shadowing and texture</subject><subject>Shading</subject><subject>Shadowing and texture</subject><subject>Studies</subject><issn>0167-7055</issn><issn>1467-8659</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><recordid>eNqNkU1v1DAQhi0EEkvhP1gcuCWMndjeHDjAlt1-qSBYKOJi2c64ZMkmxc7Szb-vw1Y9cKovnpGfZyTPSwhlkLN03m5yVkqVzaWocg6gcmAgeb5_QmYPD0_JDFiqFQjxnLyIcQMApZJiRq5Omutf7Ug_m2DaFlu6NHGg58fZEBDpou_iEHZuaPqO-j7Q027AYFL_F-kXM9J1aprumvaeHo-d2TaOfnXYYXxJnnnTRnx1fx-Rb8uP68VJdvFpdbp4f5E5ISTPmMBCcmE9r7zznIuq9Nwa56yRvK6tqhlUzBrhoAJl0VqLdSlrb7lU9RyKI_LmMPcm9H92GAe9baLDtjUd9ruoC6gElBV_DFhKXs0T-Po_cNPvQpc-oVlCRCkLlqD5AXKhjzGg1zeh2ZowagZ6ykVv9LR-Pa1fT7nof7nofVLfHdTbpsXx0Z5erJZTlfzs4DdxwP2Db8JvLVWhhL66XOmzHz_l9w_rtV4Vd5O_oug</recordid><startdate>200709</startdate><enddate>200709</enddate><creator>Shevtsov, Maxim</creator><creator>Soupikov, Alexei</creator><creator>Kapustin, Alexander</creator><general>Blackwell Publishing Ltd</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>200709</creationdate><title>Highly Parallel Fast KD-tree Construction for Interactive Ray Tracing of Dynamic Scenes</title><author>Shevtsov, Maxim ; Soupikov, Alexei ; Kapustin, Alexander</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c5562-15e3625bf29fcf22594f2baccba62ddb7d1091ba5c0907bebbbed46dfb267d803</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Algorithms</topic><topic>Color</topic><topic>Computer graphics</topic><topic>I.3.1 [Hardware Architecture]: Parallel processing</topic><topic>I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism: Ray tracing</topic><topic>I.3.7 [Computer Graphics]: Three‐Dimensional Graphics and Realism: Ray tracing; Color; Shading; Shadowing and texture</topic><topic>Shading</topic><topic>Shadowing and texture</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shevtsov, Maxim</creatorcontrib><creatorcontrib>Soupikov, Alexei</creatorcontrib><creatorcontrib>Kapustin, Alexander</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>Computer graphics forum</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shevtsov, Maxim</au><au>Soupikov, Alexei</au><au>Kapustin, Alexander</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Highly Parallel Fast KD-tree Construction for Interactive Ray Tracing of Dynamic Scenes</atitle><jtitle>Computer graphics forum</jtitle><date>2007-09</date><risdate>2007</risdate><volume>26</volume><issue>3</issue><spage>395</spage><epage>404</epage><pages>395-404</pages><issn>0167-7055</issn><eissn>1467-8659</eissn><abstract>We present a highly parallel, linearly scalable technique of kd‐tree construction for ray tracing of dynamic geometry. We use conventional kd‐tree compatible with the high performing algorithms such as MLRTA or frustum tracing. Proposed technique offers exceptional construction speed maintaining reasonable kd‐tree quality for rendering stage. The algorithm builds a kd‐tree from scratch each frame, thus prior knowledge of motion /deformation or motion constraints are not required. We achieve nearly real‐time performance of 7‐12 FPS for models with 200K of dynamic triangles at 1024x1024 resolution with shadows and textures.</abstract><cop>Oxford, UK</cop><pub>Blackwell Publishing Ltd</pub><doi>10.1111/j.1467-8659.2007.01062.x</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0167-7055 |
| ispartof | Computer graphics forum, 2007-09, Vol.26 (3), p.395-404 |
| issn | 0167-7055 1467-8659 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_30950492 |
| source | Business Source Complete; Wiley Blackwell Single Titles |
| subjects | Algorithms Color Computer graphics I.3.1 [Hardware Architecture]: Parallel processing I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism: Ray tracing I.3.7 [Computer Graphics]: Three‐Dimensional Graphics and Realism: Ray tracing Color Shading Shadowing and texture Shading Shadowing and texture Studies |
| title | Highly Parallel Fast KD-tree Construction for Interactive Ray Tracing of Dynamic Scenes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T07%3A20%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Highly%20Parallel%20Fast%20KD-tree%20Construction%20for%20Interactive%20Ray%20Tracing%20of%20Dynamic%20Scenes&rft.jtitle=Computer%20graphics%20forum&rft.au=Shevtsov,%20Maxim&rft.date=2007-09&rft.volume=26&rft.issue=3&rft.spage=395&rft.epage=404&rft.pages=395-404&rft.issn=0167-7055&rft.eissn=1467-8659&rft_id=info:doi/10.1111/j.1467-8659.2007.01062.x&rft_dat=%3Cproquest_cross%3E30946298%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=194654631&rft_id=info:pmid/&rfr_iscdi=true |