DeepAI AI Chat
Log In Sign Up

GPGPU-Parallel Re-indexing of Triangle Meshes with Duplicate-Vertex and Unused-Vertex Removal

by   Ingo Wald, et al.

We describe a simple yet highly parallel method for re-indexing "indexed" data sets like triangle meshes or unstructured-mesh data sets – which is useful for operations such as removing duplicate or un-used vertices, merging different meshes, etc. In particlar, our method is parallel and GPU-friendly in the sense that it all its steps are either trivially parallel, or use GPU-parallel primitives like sorting, prefix-sum; thus making it well suited for highly parallel architectures like GPUs.


page 1

page 2

page 3

page 4


GPU Parallel algorithm for the generation of polygonal meshes based on terminal-edge regions

This paper presents a GPU parallel algorithm to generate a new kind of p...

On-the-fly Vertex Reuse for Massively-Parallel Software Geometry Processing

Compute-mode rendering is becoming more and more attractive for non-stan...

Connectivity Compression for Irregular Quadrilateral Meshes

Applications that require Internet access to remote 3D datasets are ofte...

Sorting Data on Ultra-Large Scale with RADULS. New Incarnation of Radix Sort

The paper introduces RADULS, a new parallel sorter based on radix sort a...

AlSub: Fully Parallel and Modular Subdivision

In recent years, mesh subdivision---the process of forging smooth free-f...

GPU-friendly, Parallel, and (Almost-)In-Place Construction of Left-Balanced k-d Trees

We present an algorithm that allows for building left-balanced and compl...

Voxel-Based Indoor Reconstruction From HoloLens Triangle Meshes

Current mobile augmented reality devices are often equipped with range s...