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 ...
The use of polygonal meshes, especially triangle meshes, is manifold but a lot of algorithms require the mesh to be structured in a certain way and cannot be applied to an arbitra...
A pants decomposition of an orientable surface is a collection of simple cycles that partition into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P...
In a previous work [1] we introduced a construction designed to produce biorthogonal multiresolutions from given subdivisions. This construction was formulated in matrix terms, wh...
We present a method for contouring an implicit function using a grid topologically dual to structured grids such as octrees. By aligning the vertices of the dual grid with the fea...