Polygonization of Implicit Surfaces on Multi-Core Architectures with SIMD Instructions

Simple item page
dc.contributor.authorShirazian, Pouryaen_US
dc.contributor.authorWyvill, Brianen_US
dc.contributor.authorDuprat, Jean-Lucen_US
dc.contributor.editorHank Childs and Torsten Kuhlen and Fabio Martonen_US
dc.date.accessioned2013-11-08T10:25:57Z
dc.date.available2013-11-08T10:25:57Z
dc.date.issued2012en_US
dc.description.abstractIn this research we tackle the problem of rendering complex models which are created using implicit primitives, blending operators, affine transformations and constructive solid geometry in a design environment that organizes all these in a scene graph data structure called BlobTree. We propose a fast, scalable, parallel polygonization algorithm for BlobTrees that takes advantage of multicore processors and SIMD optimization techniques available on modern architectures. Efficiency is achieved through the usage of spatial data structures and SIMD optimizations for BlobTree traversals and the computation of mesh vertices and other attributes. Our solution delivers interactive visualization for modeling systems based on BlobTree scene graph.en_US
dc.description.seriesinformationEurographics Symposium on Parallel Graphics and Visualizationen_US
dc.identifier.isbn978-3-905674-35-4en_US
dc.identifier.issn1727-348Xen_US
dc.identifier.urihttps://doi.org/10.2312/EGPGV/EGPGV12/089-098en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.1 [Computer Graphics]: Hardware Architecture- Parallel processing I.3.6 [Computer Graphics]: Methodology and Techniques-Graphics data structures and data typesen_US
dc.titlePolygonization of Implicit Surfaces on Multi-Core Architectures with SIMD Instructionsen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
089-098.pdf
Size:
428.46 KB
Format:
Adobe Portable Document Format
Download
Collections
EGPGV12: Eurographics Symposium on Parallel Graphics and Visualization