Interval Based Data Structure Optimization

Simple item page
dc.contributor.authorDuffy, Brianen_US
dc.contributor.authorCarr, Hamishen_US
dc.contributor.editorJohn Collomosse and Ian Grimsteaden_US
dc.date.accessioned2014-01-31T20:11:58Z
dc.date.available2014-01-31T20:11:58Z
dc.date.issued2010en_US
dc.description.abstractIsosurface extraction is a widely exploited visualization technique for volumetric data on all manner of grid representation. The basic technique is often used to explore and measure many properties of data sets of ever increasing size. Therefore, data structures and algorithms that facilitate interactive exploration and fast processing of isosurfaces of large data sets is of paramount importance. While many optimal methods have been proposed to accelerate isosurface extraction, many of these algorithms have limitations with regards to storage costs and data quantization. In some cases these limitations preclude their practical application. We present a very simple clustering and volume compression technique based on observations in the span space and show that applying this technique to existing methods can reduce their storage cost. We show results for real data validating our technique.en_US
dc.description.seriesinformationTheory and Practice of Computer Graphicsen_US
dc.identifier.isbn978-3-905673-75-3en_US
dc.identifier.urihttps://doi.org/10.2312/LocalChapterEvents/TPCG/TPCG10/151-158en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): Clustering, Span Space, Quantizationen_US
dc.titleInterval Based Data Structure Optimizationen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
151-158.pdf
Size:
424.28 KB
Format:
Adobe Portable Document Format
Download
Collections
EG UK Theory and Practice of Computer Graphics 2010