Finely-Threaded History-Based Topology Computation
| dc.contributor.author | Miller, Robert | en_US |
| dc.contributor.author | Moreland, Kenneth | en_US |
| dc.contributor.author | Ma, Kwan-Liu | en_US |
| dc.contributor.editor | Margarita Amor and Markus Hadwiger | en_US |
| dc.date.accessioned | 2014-12-16T07:31:19Z | |
| dc.date.available | 2014-12-16T07:31:19Z | |
| dc.date.issued | 2014 | en_US |
| dc.description.abstract | Graphics and visualization pipelines often make use of highly parallelized algorithms which transform an input mesh into an output mesh. One example is Marching Cubes, which transforms a voxel grid into a triangle mesh approximation of an isosurface. These techniques often discard the topological connectivity of the output mesh, and instead produce a 'soup' of disconnected geometric elements. Calculations that require local neighborhood, such as surface curvature, cannot be performed on such outputs without first reconstructing its topology. We present a novel method for reconstructing topological information across several kinds of mesh transformations, which we demonstrate with GPU and OpenMP implementations. Our approach makes use of input topological elements for efficient location of coincident elements in the output. We provide performance data for the technique for isosurface generation, tetrahedralization, subdivision, and dual mesh generation, and demonstrate its use in visualization pipelines containing further computations of local curvature and mesh coarsening. | en_US |
| dc.description.seriesinformation | Eurographics Symposium on Parallel Graphics and Visualization | en_US |
| dc.identifier.isbn | 978-3-905674-59-0 | en_US |
| dc.identifier.issn | 1727-348X | en_US |
| dc.identifier.uri | https://doi.org/10.2312/pgv.20141083 | en_US |
| dc.identifier.uri | https://diglib.eg.org/handle/10.2312/pgv.20141083.041-048 | |
| dc.publisher | The Eurographics Association | en_US |
| dc.title | Finely-Threaded History-Based Topology Computation | en_US |