Performance of Marching Cubes using DirectX Compute Shaders Compared to using HistoPyramids

Visualization of volumetric data has always been useful in big va- riety of ways, for example computer tomography (CT) and magnet resonance tomography (MRT) are two major applications of this sorts of algorithms. Since volumetric data has no limitation regarding the shape of the object that ordinary...

Full description

Bibliographic Details
Main Author: Lindström, Kristoffer
Format: Others
Language:English
Published: Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation 2011
Subjects:
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4493
id ndltd-UPSALLA1-oai-DiVA.org-bth-4493
record_format oai_dc
spelling ndltd-UPSALLA1-oai-DiVA.org-bth-44932018-01-12T05:13:55ZPerformance of Marching Cubes using DirectX Compute Shaders Compared to using HistoPyramidsengPrestandajämförelse mellan Marching Cubes och HistoPyramids i DirectX Compute ShadersLindström, KristofferBlekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation2011marching cubesdirectxcompute shaderanimationterrainComputer SciencesDatavetenskap (datalogi)Human Computer InteractionMänniska-datorinteraktion (interaktionsdesign)Software EngineeringProgramvaruteknikVisualization of volumetric data has always been useful in big va- riety of ways, for example computer tomography (CT) and magnet resonance tomography (MRT) are two major applications of this sorts of algorithms. Since volumetric data has no limitation regarding the shape of the object that ordinary mesh algorithms has we can fully reconstruct anything using the Marching cubes algorithm. New tech- niques allow us to implement this algorithm by new and exible means. Here we will use the latest of DirectX technology to run marching cubes in realtime using compute shaders. kristoffer.swe@gmail.comStudent thesisinfo:eu-repo/semantics/bachelorThesistexthttp://urn.kb.se/resolve?urn=urn:nbn:se:bth-4493Local oai:bth.se:arkivex86EABECDF5C10879C12578FC00628886application/pdfinfo:eu-repo/semantics/openAccess
collection NDLTD
language English
format Others
sources NDLTD
topic marching cubes
directx
compute shader
animation
terrain
Computer Sciences
Datavetenskap (datalogi)
Human Computer Interaction
Människa-datorinteraktion (interaktionsdesign)
Software Engineering
Programvaruteknik
spellingShingle marching cubes
directx
compute shader
animation
terrain
Computer Sciences
Datavetenskap (datalogi)
Human Computer Interaction
Människa-datorinteraktion (interaktionsdesign)
Software Engineering
Programvaruteknik
Lindström, Kristoffer
Performance of Marching Cubes using DirectX Compute Shaders Compared to using HistoPyramids
description Visualization of volumetric data has always been useful in big va- riety of ways, for example computer tomography (CT) and magnet resonance tomography (MRT) are two major applications of this sorts of algorithms. Since volumetric data has no limitation regarding the shape of the object that ordinary mesh algorithms has we can fully reconstruct anything using the Marching cubes algorithm. New tech- niques allow us to implement this algorithm by new and exible means. Here we will use the latest of DirectX technology to run marching cubes in realtime using compute shaders. === kristoffer.swe@gmail.com
author Lindström, Kristoffer
author_facet Lindström, Kristoffer
author_sort Lindström, Kristoffer
title Performance of Marching Cubes using DirectX Compute Shaders Compared to using HistoPyramids
title_short Performance of Marching Cubes using DirectX Compute Shaders Compared to using HistoPyramids
title_full Performance of Marching Cubes using DirectX Compute Shaders Compared to using HistoPyramids
title_fullStr Performance of Marching Cubes using DirectX Compute Shaders Compared to using HistoPyramids
title_full_unstemmed Performance of Marching Cubes using DirectX Compute Shaders Compared to using HistoPyramids
title_sort performance of marching cubes using directx compute shaders compared to using histopyramids
publisher Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation
publishDate 2011
url http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4493
work_keys_str_mv AT lindstromkristoffer performanceofmarchingcubesusingdirectxcomputeshaderscomparedtousinghistopyramids
AT lindstromkristoffer prestandajamforelsemellanmarchingcubesochhistopyramidsidirectxcomputeshaders
_version_ 1718606920171913216