Polyhedral surface decomposition with applications

Emanuel Zuckerberger, Ayellet Tal, Shymon Shlafman

Abstract: This paper addresses the problem of decomposing a polyhedral surface into “meaningful” patches. We describe two decomposition algorithms—flooding convex decomposition and watershed decomposition, and show experimental results. Moreover, we discuss three applications which can highly benefit from surface decomposition. These applications include content-based retrieval of three-dimensional models, metamorphosis of three-dimensional models and simplification.