Polyhedral surface decomposition with applications

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 threedimensional models, metamorphosis of three-dimensional models and simplification.

3D Mesh Segmentation Methodologies for CAD applications

“…al. [48] extract the segmentation areas with a flooding of the dual graph. Specifically, their segmentation technique begins from a node traversing the graph using a Depth First or Breadth First Search.…”

“…al. [48] use the edges of the triangles to flow to the minimum. By this method, a better segmentation is achieved in some cases where the vertices of the input mesh might not be dense enough to define the catchment basins.…”

Heat-mapping: A robust approach toward perceptually consistent mesh segmentation

“…As the focus of this paper is characterization of PCMS, our scope of review is limited to closely related works. The readers are referred to [2,7,24,19,27,21] about general mesh segmentation approaches. The importance of the PCMS has been highlighted in some recent works [8,16,23,25,11] .…”

Horizontal decomposition of triangulated solids for the simulation of dip-coating processes

“…by sweep plane algorithms [10] comparable to the algorithm presented here, by flooding algorithms where adjacent surface triangles are collected for each patch until convexity is violated [10,17], or by repeatedly splitting the object in areas of concavity [11,3,23,21]. Such decompositions consist of a large number of volume parts, which can be reduced by allowing small concavities in the parts [41,23]. However, these nearly complex decompositions still contain more parts than necessary for our purpose.…”