Fast, memory-efficient cell location in unstructured grids for visualization

Applying certain visualization techniques to datasets described on unstructured grids requires the interpolation of variables of interest at arbitrary locations within the dataset's domain of definition. Typical solutions to the problem of finding the grid element enclosing a given interpolatio...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 16(2010), 6 vom: 15. Nov., Seite 1541-50
1. Verfasser: Garth, Christoph (VerfasserIn)
Weitere Verfasser: Joy, Kenneth I
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2010
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM20263504X
003 DE-627
005 20231223224702.0
007 cr uuu---uuuuu
008 231223s2010 xx |||||o 00| ||eng c
024 7 |a 10.1109/TVCG.2010.156  |2 doi 
028 5 2 |a pubmed24n0675.xml 
035 |a (DE-627)NLM20263504X 
035 |a (NLM)20975196 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Garth, Christoph  |e verfasserin  |4 aut 
245 1 0 |a Fast, memory-efficient cell location in unstructured grids for visualization 
264 1 |c 2010 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 14.12.2010 
500 |a Date Revised 26.10.2010 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a Applying certain visualization techniques to datasets described on unstructured grids requires the interpolation of variables of interest at arbitrary locations within the dataset's domain of definition. Typical solutions to the problem of finding the grid element enclosing a given interpolation point make use of a variety of spatial subdivision schemes. However, existing solutions are memory- intensive, do not scale well to large grids, or do not work reliably on grids describing complex geometries. In this paper, we propose a data structure and associated construction algorithm for fast cell location in unstructured grids, and apply it to the interpolation problem. Based on the concept of bounding interval hierarchies, the proposed approach is memory-efficient, fast and numerically robust. We examine the performance characteristics of the proposed approach and compare it to existing approaches using a number of benchmark problems related to vector field visualization. Furthermore, we demonstrate that our approach can successfully accommodate large datasets, and discuss application to visualization on both CPUs and GPUs 
650 4 |a Journal Article 
700 1 |a Joy, Kenneth I  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 16(2010), 6 vom: 15. Nov., Seite 1541-50  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g volume:16  |g year:2010  |g number:6  |g day:15  |g month:11  |g pages:1541-50 
856 4 0 |u http://dx.doi.org/10.1109/TVCG.2010.156  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 16  |j 2010  |e 6  |b 15  |c 11  |h 1541-50