This paper tackles a particular shape matching problem: given a data base of shapes (described as triangular meshes), we search for all shapes which describe a human. We do so by a...
Wolfram von Funck, Holger Theisel, Hans-Peter Seid...
—A new parameter-free graph-morphology-based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint submeshes that correspon...
Abstract. Domain decomposition for regular meshes on parallel computers has traditionally been performed by attempting to exactly partition the work among the available processors ...
Medial surfaces are popular representations of 3D objects in vision, graphics and geometric modeling. They capture relevant symmetries and part hierarchies and also allow for deta...
This paper presents a new and efficient algorithm for decomposition of 3D arbitrary triangle mesh into surface patches. Our method is based on the curvature tensor field analysis ...