Method to convert non-manifold polyhedral surfaces into manifold surfaces
First Claim
1. A computer implemented method for converting a non-manifold surface to a manifold surface, comprising steps of:
- providing data in a memory of a computer for representing a non-manifold polyhedral surface comprised of a plurality of polygons each bounded by edges and having vertices, the non-manifold polyhedral surface comprising singular vertices and edges;
analyzing the data that represents the non-manifold polyhedral surface to determine and mark the presence of the singular edges and singular vertices; and
cutting through all of the singular edges and singular vertices of the non-manifold polyhedral surface to provide a plurality of connected polyhedral surfaces that are free of singularities.
1 Assignment
0 Petitions
Accused Products
Abstract
A is a computer implemented method for converting a non-manifold surface to a manifold surface. The method includes the steps of (a) providing data in a memory of a computer for representing a non-manifold polyhedral surface comprised of a plurality of triangles each bounded by edges and having vertices; (b) analyzing the data to determine and record singular edges and singular vertices; and (c) cutting through the singular edges and singular vertices, and optionally other edges and vertices, to provide a plurality of connected polygonal surfaces that are free of singularities. The step of analyzing may include the initial steps of analyzing the data to remove isolated vertices and repeated triangles. The step of cutting operates in accordance with one of a local cutting method or a global cutting method, and may further include a step of stitching the cut surface along boundary edges.
41 Citations
35 Claims
-
1. A computer implemented method for converting a non-manifold surface to a manifold surface, comprising steps of:
-
providing data in a memory of a computer for representing a non-manifold polyhedral surface comprised of a plurality of polygons each bounded by edges and having vertices, the non-manifold polyhedral surface comprising singular vertices and edges; analyzing the data that represents the non-manifold polyhedral surface to determine and mark the presence of the singular edges and singular vertices; and cutting through all of the singular edges and singular vertices of the non-manifold polyhedral surface to provide a plurality of connected polyhedral surfaces that are free of singularities. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22)
-
-
23. A computer implemented method for converting a non-manifold surface to a manifold surface, comprising steps of:
-
providing data in a memory of a computer for representing a non-manifold polyhedral surface comprised of a plurality of polygons each bounded by edges and having vertices and a face, the non-manifold polyhedral surface comprising singular vertices and edges; analyzing the data that represents the non-manifold polyhedral surface to determine and mark the presence of the singular edges; classifying edges of all faces as being one of a boundary edge, an interior edge, or a singular edge; and cutting along the singular edges of the non-manifold polyhedral surface. - View Dependent Claims (24)
-
-
25. A computer implemented method for converting a non-manifold surface to an oriented manifold surface, comprising steps of:
-
providing data in a memory of a computer for representing a non-manifold polyhedral surface comprised of a plurality of polygons each bounded by edges and having vertices and a face, the non-manifold polyhedral surface comprising singular vertices and edges; analyzing the data that represents the non-manifold polyhedral surface to determine and mark the presence of the singular edges; classifying edges of all faces as being one of a boundary edge, an interior edge, or a singular edge; building a rooted spanning tree whose vertices are faces and whose edges are non-marked edges; traversing the spanning tree and re-orienting child faces consistently with their parent face; marking all non-marked edges that are not consistently oriented; and cutting along the singular edges of the non-manifold polyhedral surface. - View Dependent Claims (26)
-
-
27. A graphics processing system, comprising:
-
a memory storing data for representing a non-manifold polyhedral surface comprised of a plurality of polygons each bounded by edges and having vertices, the non-manifold polyhedral surface comprising singular vertices and edges; and a data processor coupled to the memory for analyzing the data that represents the non-manifold polyhedral surface to determine and mark the presence of the singular edges and singular vertices, said data processor further operating to cut through all of the singular edges and singular vertices of the non-manifold polyhedral surface to provide a plurality of connected polyhedral surfaces that are free of singularities, thereby converting a non-manifold surface to a manifold surface. - View Dependent Claims (28, 29)
-
-
30. A computer program embodied on a computer-readable medium for providing a graphics processing program, comprising:
-
a graphics data analysis code segment for analyzing data stored in a memory readable by the computer, the stored data representing a non-manifold polyhedral surface comprised of a plurality of polygons bounded by edges and having vertices, the non-manifold polyhedral surface comprising singular vertices and edges, said graphics data analysis code segment operating to determine and mark a presence of the singular edges and singular vertices in the stored data that represents the non-manifold polyhedral surface; and a cutting code segment for cutting through marked singular edges and singular vertices of the non-manifold polyhedral surface to provide a plurality of connected polyhedral surfaces. - View Dependent Claims (31, 32)
-
-
33. A computer implemented method for operating on graphics data, comprising steps of:
-
providing data in a memory of a computer for representing a non-simple mesh comprised of a plurality of polygons bounded by edges and having vertices, the non-simple mesh comprising singular vertices and edges; analyzing the data that represents the non-simple mesh to detect the presence of the singular edges and vertices; marking a set of detected singular edges and vertices; and using one of a local cutting procedure or a global cutting procedure for cutting through the set of marked singular edges and vertices of the non-simple mesh. - View Dependent Claims (34, 35)
-
Specification