Parallel Computation of Reeb Graphs on Triangular Meshes

Abstract

The Reeb graph is a concise one-dimensional representation of a shape. It has many applications in geometry processing, such as shape deformation and shape retrieval. In this paper, we propose a parallel algorithm for computing Reeb graphs on orientable 2-manifold meshes without boundary. Our algorithm is based on edge flip, which is a highly local operation, and achieves fine-grained parallelism for GPU computing.