Matrix Trees
We propose a new data representation for octrees and kd‐trees that improves upon memory size and algorithm speed of existing techniques. While pointerless approaches exploit the regular structure of the tree to facilitate efficient data access, their memory footprint becomes prohibitively large as t...
Saved in:
| Published in: | Computer graphics forum Vol. 29; no. 3; pp. 963 - 972 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Oxford, UK
Blackwell Publishing Ltd
01.06.2010
|
| Subjects: | |
| ISSN: | 0167-7055, 1467-8659 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We propose a new data representation for octrees and kd‐trees that improves upon memory size and algorithm speed of existing techniques. While pointerless approaches exploit the regular structure of the tree to facilitate efficient data access, their memory footprint becomes prohibitively large as the height of the tree increases. Pointerbased trees require memory consumption proportional to the number of tree nodes, thus exploiting the typical sparsity of large trees. Yet, their traversal is slowed by the need to follow explicit pointers across the different levels. Our solution is a pointerless approach that represents each tree level with its own matrix, as opposed to traditional pointerless trees that use only a single vector. This novel data organization allows us to fully exploit the tree's regular structure and improve the performance of tree operations. By using a sparse matrix data structure we obtain a representation that is suited for sparse and dense trees alike. In particular, it uses less total memory than pointer‐based trees even when the data set is extremely sparse. We show how our approach is easily implemented on the GPU and illustrate its performance in typical visualization scenarios. |
|---|---|
| AbstractList | We propose a new data representation for octrees and kd‐trees that improves upon memory size and algorithm speed of existing techniques. While pointerless approaches exploit the regular structure of the tree to facilitate efficient data access, their memory footprint becomes prohibitively large as the height of the tree increases. Pointerbased trees require memory consumption proportional to the number of tree nodes, thus exploiting the typical sparsity of large trees. Yet, their traversal is slowed by the need to follow explicit pointers across the different levels. Our solution is a pointerless approach that represents each tree level with its own matrix, as opposed to traditional pointerless trees that use only a single vector. This novel data organization allows us to fully exploit the tree's regular structure and improve the performance of tree operations. By using a sparse matrix data structure we obtain a representation that is suited for sparse and dense trees alike. In particular, it uses less total memory than pointer‐based trees even when the data set is extremely sparse. We show how our approach is easily implemented on the GPU and illustrate its performance in typical visualization scenarios. We propose a new data representation for octrees and kd-trees that improves upon memory size and algorithm speed of existing techniques. While pointerless approaches exploit the regular structure of the tree to facilitate efficient data access, their memory footprint becomes prohibitively large as the height of the tree increases. Pointerbased trees require memory consumption proportional to the number of tree nodes, thus exploiting the typical sparsity of large trees. Yet, their traversal is slowed by the need to follow explicit pointers across the different levels. Our solution is a pointerless approach that represents each tree level with its own matrix, as opposed to traditional pointerless trees that use only a single vector. This novel data organization allows us to fully exploit the tree's regular structure and improve the performance of tree operations. By using a sparse matrix data structure we obtain a representation that is suited for sparse and dense trees alike. In particular, it uses less total memory than pointer-based trees even when the data set is extremely sparse. We show how our approach is easily implemented on the GPU and illustrate its performance in typical visualization scenarios. [PUBLICATION ABSTRACT] AbstractWe propose a new data representation for octrees and kd-trees that improves upon memory size and algorithm speed of existing techniques. While pointerless approaches exploit the regular structure of the tree to facilitate efficient data access, their memory footprint becomes prohibitively large as the height of the tree increases. Pointerbased trees require memory consumption proportional to the number of tree nodes, thus exploiting the typical sparsity of large trees. Yet, their traversal is slowed by the need to follow explicit pointers across the different levels. Our solution is a pointerless approach that represents each tree level with its own matrix, as opposed to traditional pointerless trees that use only a single vector. This novel data organization allows us to fully exploit the tree's regular structure and improve the performance of tree operations. By using a sparse matrix data structure we obtain a representation that is suited for sparse and dense trees alike. In particular, it uses less total memory than pointer-based trees even when the data set is extremely sparse. We show how our approach is easily implemented on the GPU and illustrate its performance in typical visualization scenarios. |
| Author | Tricoche, Xavier Andrysco, Nathan |
| Author_xml | – sequence: 1 givenname: Nathan surname: Andrysco fullname: Andrysco, Nathan organization: Department of Computer Science, Purdue University – sequence: 2 givenname: Xavier surname: Tricoche fullname: Tricoche, Xavier organization: Department of Computer Science, Purdue University |
| BookMark | eNqNkMtOwzAQRS1UJPrgHypWbFL8SuwsQEIVLaACm0IlNiMncSWHNCl2KtK_xyGoi646C89Ic8_V-A5Qr6xKjdCY4AnxdZNPCI9EIKMwnlCM4wkmwr_NGeofFj3Ux8TPAofhBRo4l2OMuYjCPhq9qNqaZry0WrsROl-rwunL_z5E77OH5fQxWLzNn6b3iyDlhMQBE1wIHUcZTmQqKU-ySFNMQpWJRGdKK5EwmUm_l5pHjCVSYEoywXUaZ1RRNkTXne_WVt877WrYGJfqolClrnYOCJUskjLmzEuvjqR5tbOlvw4E59T_QbSiu06U2so5q9eQmlrVpiprq0wBBEObFeTQRgJtJNBmBX9ZQeMN5JHB1pqNsvtT0NsO_TGF3p_MwXQ-ayfPBx1vXK2bA6_sF0SCiRBWr3Pgz6tP_rFYwZL9AsRbj0c |
| CitedBy_id | crossref_primary_10_1111_cgf_14858 crossref_primary_10_1145_3234506 crossref_primary_10_1007_s12650_020_00740_0 crossref_primary_10_1111_cgf_12835 crossref_primary_10_1016_j_advengsoft_2024_103822 crossref_primary_10_1109_TVCG_2016_2620975 crossref_primary_10_1016_j_cag_2017_08_012 crossref_primary_10_1109_TVCG_2010_156 |
| Cites_doi | 10.1109/VISUAL.2005.1532796 10.1145/566654.566652 10.1109/RT.2006.280222 10.1145/1179352.1141926 10.1109/TVCG.2005.79 10.1145/1230100.1230129 10.1109/TVCG.2009.161 10.1117/12.810965 10.1145/130881.130882 10.1145/1186562.1015745 10.1109/SWG.2002.1226508 10.1145/1507149.1507152 10.1145/1572769.1572792 10.1137/0713023 10.1145/1071866.1071869 10.1145/1122501.1122503 10.1145/361002.361007 10.1201/b10635 10.1145/358728.358741 |
| ContentType | Journal Article |
| Copyright | 2010 The Author(s) Journal compilation © 2010 The Eurographics Association and Blackwell Publishing Ltd. 2010 The Eurographics Association and Blackwell Publishing Ltd. |
| Copyright_xml | – notice: 2010 The Author(s) Journal compilation © 2010 The Eurographics Association and Blackwell Publishing Ltd. – notice: 2010 The Eurographics Association and Blackwell Publishing Ltd. |
| DBID | BSCLL AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1111/j.1467-8659.2009.01709.x |
| DatabaseName | Istex CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | CrossRef Computer and Information Systems Abstracts Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1467-8659 |
| EndPage | 972 |
| ExternalDocumentID | 2112533111 10_1111_j_1467_8659_2009_01709_x CGF1709 ark_67375_WNG_4JWZ4VLW_T |
| Genre | article Feature |
| GroupedDBID | .3N .4S .DC .GA .Y3 05W 0R~ 10A 15B 1OB 1OC 29F 31~ 33P 3SF 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5HH 5LA 5VS 66C 6J9 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 8VB 930 A03 AAESR AAEVG AAHQN AAMMB AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABDBF ABDPE ABEML ABPVW ACAHQ ACBWZ ACCZN ACFBH ACGFS ACPOU ACRPL ACSCC ACUHS ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADMLS ADNMO ADOZA ADXAS ADZMN AEFGJ AEGXH AEIGN AEIMD AEMOZ AENEX AEUYR AEYWJ AFBPY AFEBI AFFNX AFFPM AFGKR AFWVQ AFZJQ AGHNM AGQPQ AGXDD AGYGG AHBTC AHEFC AHQJS AIDQK AIDYY AIQQE AITYG AIURR AJXKR AKVCP ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ARCSS ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BMXJE BNHUX BROTX BRXPI BSCLL BY8 CAG COF CS3 CWDTD D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM DU5 EAD EAP EBA EBO EBR EBS EBU EDO EJD EMK EST ESX F00 F01 F04 F5P FEDTE FZ0 G-S G.N GODZA H.T H.X HF~ HGLYW HVGLF HZI HZ~ I-F IHE IX1 J0M K1G K48 LATKE LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A NF~ O66 O9- OIG P2W P2X P4D PALCI PQQKQ Q.N Q11 QB0 QWB R.K RDJ RIWAO RJQFR ROL RX1 SAMSI SUPJJ TH9 TN5 TUS UB1 V8K W8V W99 WBKPD WIH WIK WOHZO WQJ WXSBR WYISQ WZISG XG1 ZL0 ZZTAW ~IA ~IF ~WT AAYXX CITATION O8X 7SC 8FD JQ2 L7M L~C L~D F28 FR3 |
| ID | FETCH-LOGICAL-c4119-37477e96d0b8c824bd6e2015ad7bedaea7b38d86d08e4633b87021d74ec9d2a23 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 10 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000280991300020&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0167-7055 |
| IngestDate | Thu Oct 02 07:05:57 EDT 2025 Fri Jul 25 23:28:26 EDT 2025 Tue Nov 18 22:14:12 EST 2025 Sat Nov 29 08:17:08 EST 2025 Sun Sep 21 06:19:57 EDT 2025 Sun Sep 21 06:18:08 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c4119-37477e96d0b8c824bd6e2015ad7bedaea7b38d86d08e4633b87021d74ec9d2a23 |
| Notes | ark:/67375/WNG-4JWZ4VLW-T istex:279A656F361372749E50DEF6E80E58E3725DB194 ArticleID:CGF1709 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| PQID | 744276573 |
| PQPubID | 30877 |
| PageCount | 10 |
| ParticipantIDs | proquest_miscellaneous_1283688943 proquest_journals_744276573 crossref_citationtrail_10_1111_j_1467_8659_2009_01709_x crossref_primary_10_1111_j_1467_8659_2009_01709_x wiley_primary_10_1111_j_1467_8659_2009_01709_x_CGF1709 istex_primary_ark_67375_WNG_4JWZ4VLW_T |
| PublicationCentury | 2000 |
| PublicationDate | June 2010 |
| PublicationDateYYYYMMDD | 2010-06-01 |
| PublicationDate_xml | – month: 06 year: 2010 text: June 2010 |
| PublicationDecade | 2010 |
| PublicationPlace | Oxford, UK |
| PublicationPlace_xml | – name: Oxford, UK – name: Oxford |
| PublicationTitle | Computer graphics forum |
| PublicationYear | 2010 |
| Publisher | Blackwell Publishing Ltd |
| Publisher_xml | – name: Blackwell Publishing Ltd |
| References | Bridson R.: Fluid Simulation for Computer Graphics. A K Peters, Ltd., Wellesley , MA , USA , 2008. Wilhelms J., Van Gelder A.: Octrees for faster isosurface generation. ACM Trans. Graph. 11, 3 (1992), 201-227. Benson D., Davis J.: Octree textures. ACM Trans. Graph. 21, 3 (2002), 785-790. Wald I., Friedrich H., Marmitt G., Seidel H.-P.: Faster isosurface ray tracing using implicit kd-trees. IEEE Transactions on Visualization and Computer Graphics 11, 5 (2005), 562-572. Member-Slusallek, Philipp. Aila T., Laine S.: Understanding the efficiency of ray traversal on gpus. In Proc. High-Performance Graphics 2009 (2009). Gargantini I.: An effective way to represent quadtrees. Commun. ACM 25, 12 (1982), 905-910. Gibbs N., Jr. W. P. Stockmeyer P.: An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM Journal of Numerical Analysis 13, 2 (1976), 236-250. Bargteil A. W., Goktekin T. G., O'Brien J. F., Strain J. A.: A semi-lagrangian contouring method for fluid simulation. ACM Transactions on Graphics 25, 1 (2006). Bentley J. L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18, 9 (1975), 509-517. Samet H.: The design and analysis of spatial data structures. Addison-Wesley Longman Publishing Co., Inc., Boston , MA , USA , 1990. Morton G.: A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing. Tech. rep., IBM Ltd., 1966. Hughes D. M., Lim I. S.: Kd-jump: a path-preserving stackless traversal for faster isosurface raytracing on gpus. IEEE Transactions on Visualization and Computer Graphics 15, 6 (2009), 1555-1562. 1975; 18 2009 June 2006 2008 2007 Sept. 2006 2006 2005 2004 2003 2002 June 2009 1992; 11 1982; 25 2009; 2009 1976; 13 2001 1990 Oct. 2005 2002; 21 2006; 25 Dec. 2008 2005; 11 2009; 15 2001; 2001 1966 e_1_2_7_5_2 e_1_2_7_4_2 e_1_2_7_3_2 e_1_2_7_2_2 e_1_2_7_9_2 e_1_2_7_8_2 e_1_2_7_7_2 e_1_2_7_6_2 e_1_2_7_19_2 e_1_2_7_18_2 e_1_2_7_17_2 Morton G. (e_1_2_7_23_2) 1966 Song Y. (e_1_2_7_25_2) 2009 e_1_2_7_16_2 e_1_2_7_15_2 e_1_2_7_14_2 e_1_2_7_13_2 e_1_2_7_12_2 e_1_2_7_11_2 e_1_2_7_10_2 e_1_2_7_27_2 e_1_2_7_28_2 Samet H. (e_1_2_7_24_2) 1990 e_1_2_7_22_2 e_1_2_7_21_2 e_1_2_7_20_2 Velasco F. (e_1_2_7_26_2) 2001 |
| References_xml | – reference: Benson D., Davis J.: Octree textures. ACM Trans. Graph. 21, 3 (2002), 785-790. – reference: Bargteil A. W., Goktekin T. G., O'Brien J. F., Strain J. A.: A semi-lagrangian contouring method for fluid simulation. ACM Transactions on Graphics 25, 1 (2006). – reference: Gargantini I.: An effective way to represent quadtrees. Commun. ACM 25, 12 (1982), 905-910. – reference: Bridson R.: Fluid Simulation for Computer Graphics. A K Peters, Ltd., Wellesley , MA , USA , 2008. – reference: Gibbs N., Jr. W. P. Stockmeyer P.: An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM Journal of Numerical Analysis 13, 2 (1976), 236-250. – reference: Aila T., Laine S.: Understanding the efficiency of ray traversal on gpus. In Proc. High-Performance Graphics 2009 (2009). – reference: Wald I., Friedrich H., Marmitt G., Seidel H.-P.: Faster isosurface ray tracing using implicit kd-trees. IEEE Transactions on Visualization and Computer Graphics 11, 5 (2005), 562-572. Member-Slusallek, Philipp. – reference: Bentley J. L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18, 9 (1975), 509-517. – reference: Morton G.: A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing. Tech. rep., IBM Ltd., 1966. – reference: Samet H.: The design and analysis of spatial data structures. Addison-Wesley Longman Publishing Co., Inc., Boston , MA , USA , 1990. – reference: Hughes D. M., Lim I. S.: Kd-jump: a path-preserving stackless traversal for faster isosurface raytracing on gpus. IEEE Transactions on Visualization and Computer Graphics 15, 6 (2009), 1555-1562. – reference: Wilhelms J., Van Gelder A.: Octrees for faster isosurface generation. ACM Trans. Graph. 11, 3 (1992), 201-227. – year: 2009 – volume: 18 start-page: 509 issue: 9 year: 1975 end-page: 517 article-title: Multidimensional binary search trees used for associative searching publication-title: Commun. ACM – year: June 2009 – volume: 11 start-page: 201 issue: 3 year: 1992 end-page: 227 article-title: Octrees for faster isosurface generation publication-title: ACM Trans. Graph – year: 1966 – volume: 11 start-page: 562 issue: 5 year: 2005 end-page: 572 article-title: Faster isosurface ray tracing using implicit kd‐trees publication-title: IEEE Transactions on Visualization and Computer Graphics – volume: 25 start-page: 905 issue: 12 year: 1982 end-page: 910 article-title: An effective way to represent quadtrees publication-title: Commun. ACM – year: 2001 – start-page: 199 year: Oct. 2005 end-page: 206 – volume: 15 start-page: 1555 issue: 6 year: 2009 end-page: 1562 article-title: Kd‐jump: a path‐preserving stackless traversal for faster isosurface raytracing on gpus publication-title: IEEE Transactions on Visualization and Computer Graphics – start-page: 457 year: 2004 end-page: 462 – year: 1990 – volume: 2001 start-page: 151 year: 2001 end-page: 158 – year: June 2006 – volume: 2009 year: 2009 article-title: Understanding the efficiency of ray traversal on gpus publication-title: Proc. High-Performance Graphics – year: Dec. 2008 – start-page: 37 year: 2002 end-page: 44 – volume: 25 issue: 1 year: 2006 article-title: A semi‐lagrangian contouring method for fluid simulation publication-title: ACM Transactions on Graphics – year: 2008 – start-page: 15 year: 2009 end-page: 22 – volume: 21 start-page: 785 issue: 3 year: 2002 end-page: 790 article-title: Octree textures publication-title: ACM Trans. Graph – start-page: 15 year: 2005 end-page: 22 – volume: 13 start-page: 236 issue: 2 year: 1976 end-page: 250 article-title: An algorithm for reducing the bandwidth and profile of a sparse matrix publication-title: SIAM Journal of Numerical Analysis – start-page: 27 year: 2003 end-page: 35 – start-page: 115 year: Sept. 2006 end-page: 124 – start-page: 167 year: 2007 end-page: 174 – start-page: 579 year: 2006 end-page: 588 – ident: e_1_2_7_9_2 doi: 10.1109/VISUAL.2005.1532796 – ident: e_1_2_7_4_2 doi: 10.1145/566654.566652 – ident: e_1_2_7_16_2 – ident: e_1_2_7_18_2 doi: 10.1109/RT.2006.280222 – ident: e_1_2_7_21_2 doi: 10.1145/1179352.1141926 – start-page: 151 volume-title: VMV '01: Proceedings of the Vision Modeling and Visualization Conference year: 2001 ident: e_1_2_7_26_2 – ident: e_1_2_7_27_2 doi: 10.1109/TVCG.2005.79 – ident: e_1_2_7_15_2 doi: 10.1145/1230100.1230129 – ident: e_1_2_7_14_2 doi: 10.1109/TVCG.2009.161 – volume-title: Computer Graphics Forum year: 2009 ident: e_1_2_7_25_2 – ident: e_1_2_7_17_2 doi: 10.1117/12.810965 – ident: e_1_2_7_6_2 – volume-title: A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing year: 1966 ident: e_1_2_7_23_2 – ident: e_1_2_7_28_2 doi: 10.1145/130881.130882 – ident: e_1_2_7_20_2 doi: 10.1145/1186562.1015745 – ident: e_1_2_7_19_2 doi: 10.1109/SWG.2002.1226508 – ident: e_1_2_7_10_2 doi: 10.1145/1507149.1507152 – ident: e_1_2_7_2_2 doi: 10.1145/1572769.1572792 – ident: e_1_2_7_13_2 doi: 10.1137/0713023 – ident: e_1_2_7_3_2 – ident: e_1_2_7_22_2 – ident: e_1_2_7_11_2 doi: 10.1145/1071866.1071869 – ident: e_1_2_7_7_2 doi: 10.1145/1122501.1122503 – ident: e_1_2_7_5_2 doi: 10.1145/361002.361007 – ident: e_1_2_7_8_2 doi: 10.1201/b10635 – ident: e_1_2_7_12_2 doi: 10.1145/358728.358741 – volume-title: The design and analysis of spatial data structures year: 1990 ident: e_1_2_7_24_2 |
| SSID | ssj0004765 |
| Score | 1.9945208 |
| Snippet | We propose a new data representation for octrees and kd‐trees that improves upon memory size and algorithm speed of existing techniques. While pointerless... We propose a new data representation for octrees and kd-trees that improves upon memory size and algorithm speed of existing techniques. While pointerless... AbstractWe propose a new data representation for octrees and kd-trees that improves upon memory size and algorithm speed of existing techniques. While... |
| SourceID | proquest crossref wiley istex |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 963 |
| SubjectTerms | Algorithms C (programming language) Computer graphics Computer Graphics [I.3.5]: Object hierarchies Computer Graphics [I.3.6]: Methodology and Techniques-Graphics data structures and data types Footprints Mathematical analysis Matrix Octrees Representations Sparsity Studies Trees Vectors (mathematics) Visualization |
| Title | Matrix Trees |
| URI | https://api.istex.fr/ark:/67375/WNG-4JWZ4VLW-T/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fj.1467-8659.2009.01709.x https://www.proquest.com/docview/744276573 https://www.proquest.com/docview/1283688943 |
| Volume | 29 |
| WOSCitedRecordID | wos000280991300020&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVWIB databaseName: Wiley Online Library Full Collection 2020 customDbUrl: eissn: 1467-8659 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004765 issn: 0167-7055 databaseCode: DRFUL dateStart: 19970101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3dS8MwED9k80EFv8U6lQni22Bt0nw8yrQTmUNkc-JLSJoIonTSbrI_36Tt5oY-DPGlFMKV5j5yl-TudwDnzdg6jbwaR2K7QZE6bEhleANJbTB-CTnROG82Qbtd9vTE78v8J1cLU-BDzA7cnGXk67UzcKmyn0bOSMhL2Emf2qeNJ6uBVWNcgerVQ9TvfFdJUhJOkb4dhsxiXs-v31pwVlXH98lCJDofz-YOKdr6z6lsw2YZltYvCz3agRWT7ML6HFjhHmzcOTT_Sb2XGpPtQz-67rVuGmUvhUaMfd_y3m4bqLGcbyoWswArTYz1_aHUVBktjaQKMc3sODOYIKSsHQe-ptjEXAcyQAdQSYaJOYQ6k02fcamRosrdmyoeYsPtSkGsVuom8YBOmSbiEmjc9bt4FwsbDircfF0bTC7y-YqJB_6M8qMA21iC5iKXy4xApm8uWY2GYtBtC3w7eMaPnYHoeVCbCk6UdpoJinFg1YIiD85mo9bA3K2JTMxwnAnrwBFhDqbeA5JLcel_E6125N6O_kpYg7UiW8Gd-hxDZZSOzQmsxp-j1yw9LRX8Cw6s8_U |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3rS8MwED9kE3yAb7HOxwTx22Bt0yb5KNNt6jZENid-CUkTQZRN9pD9-V7arm7ohyF-KYVwpXe5yz2S_A7gvByh04hv40iCCYrUQUkqw0u-1IaQl4CHmsTNJmirxZ6e-H3aDsjehUnwIbKCm7WMeL22Bm4L0j-tnIUBT3EnXYpPDCjzBLUqyEH-6qHaaXxfk6RhMIX6tiAy8wd7fv3WnLfKW8FP5kLR2YA29kjVzX_lZQs20sC0eJlo0jYsmd4OrM3AFe7CetPi-U-K7YExwz3oVK_blXop7aZQiojrovQxcaAGZV9WLGIeUTo06P0DqakyWhpJlc80w3FmUH6-Qkv2XE2Jibj2pOfvQ67X75kDKDJZdhmX2ldU2Z1TxQNiOK4VIeqlLocO0KnURJRCjduOF-9iLuWgwvJrG2FyEfMrJg64GeVHArexAM1FPDEZgRy82eNqNBDdVk2Q2-4zeWx0RduBwnTmRGqpQ0EJ8VAvqO_AWTaKJmb3TWTP9MdDgS7cD5kFqncgjKdx4X8TlVrVvh3-lfAUVurtZkM0blp3BVhNzi7YGtAR5EaDsTmG5ehz9DocnKTa_gXO4ffl |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1bS8MwFD7IJqKCd7HOywTxbbC2aS6P4qy3OUSmG76EpIkgSh3blP18T9puOvRBxJdSCCdtTs6Xc3L7DsBhPUGnkd3GUQQnKMpENaWtqIXKWEIeI0ENyZJNsFaLd7vipkgH5O7C5PwQkwU3h4xsvHYAtz3z-B3lnEai4J30GT4xoCwT_AaitNy4je-an9ckGY3GVN-ORGb6YM-PdU15q7JT_GgqFP0a0GYeKV7-17aswFIRmFaPc0tahRmbrsHCF7rCdVi8dnz-o2q7b-1gA-7i0_bJea3IplBLiO-j9nHiwCzqvq55wgOiDbXo_SNlmLZGWcV0yA3Hcm4JDUONSA58w4hNhAlUEG5CKX1N7RZUuar7XCgTaqbdzqkWEbECxwqKdmnq1AM21ppMCqpxl_HiRU5NOZh07XWJMIXM2itHHvgTyV5Ot_ELmaOsYyYCqv_sjquxSHZaZ5Jcdh7IfbMj2x5Uxj0nC6QOJCMkQLtgoQcHk1KEmNs3Ual9fRtIdOEh5Y6o3gOadeOv_02enMXubfuvgvswd9OIZfOidVWB-fzoglsC2oHSsP9md2E2eR8-Dfp7hbF_AGFF92A |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Matrix+Trees&rft.jtitle=Computer+graphics+forum&rft.au=Andrysco%2C+Nathan&rft.au=Tricoche%2C+Xavier&rft.date=2010-06-01&rft.pub=Blackwell+Publishing+Ltd&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=29&rft.issue=3&rft.spage=963&rft.epage=972&rft_id=info:doi/10.1111%2Fj.1467-8659.2009.01709.x&rft.externalDBID=n%2Fa&rft.externalDocID=ark_67375_WNG_4JWZ4VLW_T |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-7055&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-7055&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-7055&client=summon |