US6943790B2  Dual mesh resampling  Google Patents
Dual mesh resampling Download PDFInfo
 Publication number
 US6943790B2 US6943790B2 US10/270,831 US27083102A US6943790B2 US 6943790 B2 US6943790 B2 US 6943790B2 US 27083102 A US27083102 A US 27083102A US 6943790 B2 US6943790 B2 US 6943790B2
 Authority
 US
 United States
 Prior art keywords
 mesh
 dual
 primal
 polygon mesh
 polygon
 Prior art date
 Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
 Expired  Fee Related, expires
Links
 230000000875 corresponding Effects 0.000 claims description 157
 238000009499 grossing Methods 0.000 claims description 31
 238000004590 computer program Methods 0.000 claims description 18
 230000002093 peripheral Effects 0.000 claims description 17
 238000006073 displacement Methods 0.000 claims description 15
 238000004519 manufacturing process Methods 0.000 claims description 12
 230000002452 interceptive Effects 0.000 claims description 10
 230000000694 effects Effects 0.000 claims description 9
 230000003287 optical Effects 0.000 claims description 8
 238000007670 refining Methods 0.000 claims description 7
 230000015572 biosynthetic process Effects 0.000 claims 3
 238000005755 formation Methods 0.000 claims 3
 238000000034 methods Methods 0.000 description 16
 230000000704 physical effects Effects 0.000 description 3
 238000006243 chemical reaction Methods 0.000 description 2
 239000000463 materials Substances 0.000 description 1
Images
Classifications

 G—PHYSICS
 G06—COMPUTING; CALCULATING; COUNTING
 G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
 G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
 G06T17/20—Finite element generation, e.g. wireframe surface description, tesselation
 G06T17/205—Remeshing

 G—PHYSICS
 G06—COMPUTING; CALCULATING; COUNTING
 G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
 G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
 G06T17/20—Finite element generation, e.g. wireframe surface description, tesselation
Abstract
Description
This invention relates to the field of resampling signals defined on polygon meshes in computeraided geometric design, geometric modeling, and computer graphics. More specifically, the invention relates to the field of resampling of signals defined on polygon meshes while minimizing signal loss.
Polygon meshes are widely used in computer aided geometric design, geometric modeling, and computer graphics to represent surfaces in digital form. Polygon meshes are described in detail in U.S. Pat. No. 5,506,947 “Curve and Surface Smoothing Without Shrinkage,” by G. Taubin, and in the paper “A Signal Processing Approach To Fair Surface Design,” by G. Taubin, Siggraph'95 Conference Proceedings, August 1995, pages 351358, both are here incorporated herein by reference in entirety for all purposes. A polygon mesh includes a polygon mesh connectivity and a primal mesh signal. As used herein a primal mesh is the same as a polygon mesh.
A polygon mesh connectivity includes a plurality of polygon mesh vertices, and polygon mesh faces. Each polygon mesh face has three or more corners. Each corner is one of the polygon mesh vertices. Every mesh face is said to be “supported by” its corners. A polygon mesh edge is an unordered pair of mesh vertices that are consecutive in at least one polygon mesh face, in which case the polygon mesh edge is said to be “on the boundary” of the polygon mesh face, and “to join” the two polygon mesh vertices, and the polygon mesh face is said to be “incident” to the polygon mesh edge. One or more polygon mesh faces may be incident to the same polygon mesh edge. A regular edge is a polygon mesh edge with exactly two incident polygon mesh faces.
A graph is composed of a plurality of graph vertices and graph edges, with each graph edge being an unordered pair of graph vertices. Graphs are well known to those skilled of the prior art. The dual graph of a polygon mesh connectivity is a graph with the polygon mesh faces as dual graph vertices, and a plurality of dual graph edges, with each dual graph edge corresponding to a particular regular edge of the polygon mesh connectivity, and composed of the two polygon mesh faces which the regular edge is incident to. A regular mesh vertex is a polygon mesh vertex such that the polygon mesh faces incident to it form a cycle in the dual graph. The dual mesh connectivity of a polygon mesh connectivity includes a plurality of dual mesh vertices and dual mesh faces. The dual mesh vertices are the polygon mesh faces, and the dual mesh faces are the cycles of polygon mesh faces corresponding to the regular mesh vertices. The dual corners of a dual mesh face are the polygon mesh faces which have the regular mesh vertex as corner in the polygon mesh connectivity. The polygon mesh connectivity from which the dual mesh connectivity is generated is also called the primal mesh connectivity, and the polygon mesh vertices and faces are called primal mesh vertices and faces, respectively. The regular edges of a primal mesh are also called regular primal edges. The regular edges of a dual mesh are also called regular dual edges. It is known in the prior art that there is a onetoone correspondence between regular primal edges and regular dual edges.
A polygon mesh connectivity is called manifold without boundary when all its polygon mesh vertices and polygon mesh edges are regular. The construction of the dual mesh connectivity from a polygon mesh connectivity can be regarded as an operator operating on the family of all the polygon mesh connectivities. We call this operator dual mesh operator. It is known that when the dual mesh operator is applied to the dual mesh connectivity of a primal mesh connectivity, a polygon mesh connectivity equivalent to the primal mesh connectivity is obtained if and only if the primal mesh connectivity is manifold without boundary. Data structures to represent the primal and dual mesh connectivities of a manifold without boundary polygon mesh are described in the prior art.
A primal mesh signal is composed of primal points. Each primal point is a point in a Ndimensional space and corresponds to one of the polygon mesh vertices of the polygon mesh connectivity. These primal points of a primal mesh signal may represent different properties of the polygon mesh, such as vertex positions which define the geometry of the polygon mesh, color vectors, normal vectors, and texture coordinates used to generate pictures of the shape represented by the polygon mesh. The primal points of a primal mesh signal may also represent physical properties such as temperature or mechanical strain forces associated with numerical simulations.
A dual mesh signal is composed of dual points. Each dual point is a point in the same Ndimensional space and corresponds to one polygon mesh face of the polygon mesh connectivity. The dual points of the dual mesh signal are usually computed as a function of the primal points of a primal mesh signal. The barycenter dual signal is a dual mesh signal where each dual point is computed as the face barycenter or average of the primal points associated with the corners of the corresponding primal mesh face. The barycenter dual mesh of a polygon mesh is composed of the dual mesh connectivity of the polygon mesh connectivity and the barycenter dual signal of the primal mesh signal.
The approximation of a smooth surface embedded in Ndimensional space by a polygon mesh can be regarded as the analog to digital conversion process in signal processing, where the polygon mesh connectivity extends the classical notion of regular resampling to the irregular setting. Sometimes it is necessary to change the resampling rate of a given input digital signal, and it is desirable to do so directly in the digital domain, without reconstructing the analog signal. Such processes that produce an output digital signal directly from an input digital signal as referred to in the prior art as resampling processes. The input digital signal to a resampling process is also called resampled signal, and the output digital signal is also called resampled signal. When such a resampling process is performed, it is important to prevent signal degradation. Wellestablished methods exist in the prior art to resample signals defined on regular grids, but no extensions are known for signals defined on irregular polygon meshes. One way to measure signal degradation is to apply the same resampling process to the resampled signal to obtain a new digital signal at the original resampling rate, and then compare this new digital signal with the resampled signal. The construction of the barycenter dual mesh of a polygon mesh can be regarded as a resampling operator. The square of this operator produces new primal points on the vertices of the original resampled polygon mesh. The problem is that this resampling process produces significant signal loss. In fact, if the barycenter dual mesh operator is applied iteratively, over and over again, all the primal and dual points converge simultaneously to a single point in Ndimensional space, i.e., to a constant signal. The mathematical details are explained in the paper “Dual Mesh Resampling,” by G. Taubin, Pacific Graphics Conference Proceedings, Tokyo, Japan, October 2001, which is here incorporated by reference in its entirety for all purposes.
Sometimes polygon meshes are constructed as the result of measurements performed by a threedimensional camera, laser scanner, CAT scanner, or other threedimensional shape measurement device. These polygon meshes approximate the topology and geometry of a physical object, as opposed of a virtual object created in a computer without a physical realization. Data obtained as a result of physical measurements contain noise. Mesh smoothing algorithms are used to remove the noise from the geometry of polygon meshes. Most mesh smoothing algorithms derive from Laplacian smoothing. Laplacian smoothing, as well as an extension that solves the problem of shrinkage, is described in the papers cited above, “A Signal Processing Approach To Fair Surface Design,” by G. Taubin, Siggraph'95 Conference Proceedings, August 1995, pages 351358, and in U.S. Pat. No. 5,506,947 “Curve and Surface Smoothing Without Shrinkage,” by G. Taubin. A number of other enhancements to Laplacian smoothing have been introduced in recent years to try to overcome some of its limitations. Despite these improvements existing polygon mesh smoothing processes lack sufficient balance between amount of smoothing and speed of the smoothing process.
Subdivision surfaces have become a popular type of prior art polygon meshes used in modeling and animation. A subdivision surface is a smooth surface obtained as the limit of an infinite sequence of polygon meshes, where the next polygon mesh in the sequence is obtain from its predecessor by first refining the connectivity, and then computing appropriate vertex positions on the vertices of the refined connectivity as a function of the vertex positions of the coarse connectivity. The computation of refined vertex positions is usually a two step process, with a first linear interpolation step, and a second smoothing step. A subdivision polygon mesh is a polygon mesh obtained by applying a finite number of refinement operations to a base polygon mesh. The most popular subdivision schemes are those proposed by Loop in “Smooth Subdivision Surfaces Based on Triangles,” by C. Loop, Master Thesis, Dept. of Mathematics, University of Utah”, August “1987”; by Catmull and Clark in the paper “Recursively Generated BSpline Surfaces on Arbitrary Topological Meshes,” by E. Catmull, and J. Clark, CAD, volume 10, pages 350355, 1978, and by Doo and Sabin in the paper “Behavior of Recursive Division Surfaces Near Extraordinary Points”, by D. Doo, and M. Sabin, CAD, volume 10, pages 356360, 1978. More recent advances in this area are described in “Course 23: Subdivision for Modeling and Animation,” by D. Zorin and P. Schröder (eds.), Siggraph'2000 Course Notes, July 2000. One remaining problem with subdivision surfaces is that the number of polygon mesh faces increases to fast in the sequence of polygon meshes. For example, both in Loop's and CatmullClark schemes the number of faces grows by a factor of four from one polygon mesh of the sequence to the next. It is desirable to design subdivision schemes where the number of faces grows less rapidly. One such scheme for triangle meshes is described in the paper “Square Root of 3 Subdivision,” by L. Kobbelt, Siggraph'2000 Conference Proceedings, pages 103112, July 2000. It is known that the connectivity refinement operator of the CatmullClark scheme has a square root. Herein, disclosure we will call this operator the primaldual connectivity refinement operator. The number of faces grows approximately by two when the primaldual connectivity refinement operator is used to refine the connectivity. The problem is that no method has been proposed to properly refine the geometry, i.e., to determine the vertex positions of the refined connectivity in such a way that the smoothness increases with the sequence of polygon meshes.
When the primaldual connectivity refinement operator is applied to a primal mesh connectivity, a primaldual mesh connectivity is produced. The primaldual mesh connectivity is composed of primaldual mesh vertices and primaldual mesh faces. Each primaldual vertex is either a primal mesh vertex or a primal mesh face. Each primadual face corresponds to one particular regular edge of the primal mesh connectivity. The corners of the primaldual face are the two primal mesh vertices that the regular edge joins and the two primal mesh faces incident to the regular edge.
An aspect of this invention is provision of apparatus, systems and methods to compute a dual mesh signal by resampling a primal mesh signal minimizing signal loss.
A second aspect of this invention is provision of apparatus, systems and methods to construct a dual mesh from a primal polygon mesh with dual points located in positions that minimize the loss of information.
A third aspect of this invention is provision of apparatus, systems and methods for smoothing a polygon mesh signal defined on the polygon mesh vertices of a polygon mesh connectivity, that provides enhanced balance between amount and speed of the smoothing process.
A fourth aspect of this invention is provision of apparatus, systems and methods to subdivide a polygon mesh, where the number of faces grows approximately by a factor of two.
The present invention applies to a general and arbitrary primal mesh. The primal mesh includes a primal mesh connectivity and at least one primal mesh signal. The primal mesh connectivity includes a plurality of primal mesh vertices and a plurality of primal mesh faces. The primal mesh signal includes a plurality of primal points, with each primal point corresponds to a primal mesh vertex of the primal mesh connectivity, and being a point in a Ndimensional space. The primal points may represent vertex coordinates of a threedimensional shape, colors, normal vectors, texture coordinates, or any other physical properties. Polygon meshes are widely used in computer graphics, physics, and engineering applications to represent smooth surfaces and associated properties in digital form. They are created with interactive threedimensional modeling systems, or as discretizations of continuous problems in numerical simulations.
The present invention includes resampling systems and methods to compute a dual mesh signal by resampling a primal mesh signal while minimizing signal loss. The dual mesh signal includes a plurality of dual points, with each dual point corresponding to a primal mesh face of the primal mesh connectivity, and being a point in the Ndimensional space. The dual points of the dual mesh signal are computed in the resampling method by minimizing an energy function that relates the primal points to the dual points, while the primal points are constrained not to change. In an advantageous embodiment the energy function is a quadratic energy function of the primal points and the dual points composed of a sum of square terms, each square term corresponding to one particular regular edge of the primal mesh connectivity, each square term being the square of a difference term, the difference term computed by subtracting the sum of the two dual points corresponding to the two primal mesh faces incident to the particular regular edge from the sum of the two primal points corresponding to the two primal mesh vertices joined by the regular edge.
This invention also includes systems and methods to construct a dual mesh from a primal mesh. The dual mesh includes a dual mesh connectivity and a dual mesh signal. The dual mesh connectivity being constructed using a prior art method. The dual mesh signal being constructed with the resampling method described above by resampling the primal mesh signal of the primal mesh.
This invention also includes systems and methods for smoothing the primal mesh signal of the primal mesh. In a first step a dual mesh signal is computed with the resampling method described above by resampling the primal mesh signal. In a second step the primal mesh signal is recomputed by minimizing the same energy function that relates the primal points to the dual points, but here with the dual points constrained not to change.
This invention also includes systems and methods to construct a primaldual mesh from a primal mesh. The primaldual mesh including a primaldual mesh connectivity and a primaldual mesh signal. The primaldual mesh connectivity being constructed using a prior art method, and having a plurality of primaldual mesh vertices and a plurality of primaldual mesh faces. Each of the primaldual mesh vertices corresponding to either one primal vertex or one primal face of the primal mesh connectivity. Each of the primaldual mesh faces corresponds to one particular regular edge of the primal mesh connectivity. The primaldual mesh signal being constructed by concatenating the primal mesh signal and a dual mesh signal. The dual mesh signal being constructed with the resampling method described above by resampling the primal mesh signal of the primal mesh.
These and other aspects, features, and advantages of the present invention will become apparent upon further consideration of the following detailed description of the invention when read in conjunction with the drawing figures, in which:
The present invention provides systems and methods to compute a dual mesh signal by resampling a primal mesh signal minimizing signal loss, to construct a dual mesh from a primal polygon mesh with dual points located in positions that minimize the loss of information, to subdivide a polygon mesh, where the number of faces grows approximately by a factor of two, and for smoothing a polygon mesh signal defined on the polygon mesh vertices of a polygon mesh connectivity exhibiting enhanced balance between amount and speed of the smoothing process. It applies to a general and arbitrary polygon mesh, also referred to as primal mesh. The primal mesh includes a primal mesh connectivity and at least one primal mesh signal. The primal mesh connectivity includes a plurality of primal mesh vertices and a plurality of primal mesh faces. The primal mesh signal includes a plurality of primal points, with each primal point corresponding to a primal mesh vertex of the primal mesh connectivity, and being a point in a Ndimensional space. The primal points may represent vertex coordinates of a threedimensional shape, colors, normal vectors, texture coordinates, or any other physical properties. Polygon meshes are widely used in computer graphics, physics, and engineering applications to represent smooth surfaces and associated properties in digital form. They are created with interactive threedimensional modeling systems, or as discretizations of continuous problems in numerical simulations.
The present invention computes a dual mesh signal by resampling a primal mesh signal while minimizing signal loss. The dual mesh signal includes a plurality of dual points, with each dual point corresponding to a primal mesh face of the primal mesh connectivity, and being a point in the Ndimensional space. The dual points of the dual mesh signal are computed in the resampling method by minimizing an energy function that relates the primal points to the dual points, while the primal points are constrained not to change. In an advantageous embodiment the energy function is a quadratic energy function of the primal points and the dual points composed of a sum of square terms, each square term corresponding to one particular regular edge of the primal mesh connectivity, each square term being the square of a difference term, the difference term computed by subtracting the sum of the two dual points corresponding to the two primal mesh faces incident to the particular regular edge from the sum of the two primal points corresponding to the two primal mesh vertices joined by the regular edge.
This invention also includes systems and methods to construct a dual mesh from a primal mesh. The dual mesh including a dual mesh connectivity and a dual mesh signal. The dual mesh connectivity being constructed using a prior art method. The dual mesh signal being constructed with the resampling method described above by resampling the primal mesh signal of the primal mesh.
This invention also includes systems and methods for smoothing the primal mesh signal of the primal mesh. In a first step a dual mesh signal is computed with the resampling method described above by resampling the primal mesh signal. In a second step the primal mesh signal is recomputed by minimizing the same energy function that relates the primal points to the dual points, but here with the dual points are constrained not to change.
This invention also includes systems and methods to construct a primaldual mesh from the primal mesh. The primaldual mesh including a primaldual mesh connectivity and a primaldual mesh signal. The primaldual mesh connectivity being constructed using a prior art method, and having a plurality of primaldual mesh vertices and a plurality of primaldual mesh faces. Each of the primaldual mesh vertices corresponding to either one primal vertex or one primal face of the primal mesh connectivity. Each of the primaldual mesh faces corresponds to one particular regular edge of the primal mesh connectivity. The primaldual mesh signal being constructed by concatenating the primal mesh signal and a dual mesh signal. The dual mesh signal being constructed with the resampling method described above by resampling the primal mesh signal of the primal mesh.
In an example embodiment the input source includes at least one input source from a group of input sources including: an output from a computer program; a computer memory buffer; a display screen buffer; a computer file stored in a nonvolatile storage medium; a computer file stored in a magnetic storage device; a computer file stored in an optical storage device; a computer file stored in a computer network; a document scanner; a threedimensional scanner; an electronic tablet; an interactive modeling system; and a threedimensional photography system.
In an example embodiment the output source includes at least one output source from a group of output sources including: an input to a computer program; a computer memory buffer; a display screen buffer; a computer file stored in a nonvolatile storage medium; a computer file stored in a magnetic storage device; a computer file stored in an optical storage device; a computer file stored in a computer network; a virtual prototyping machine; a numericallycontrolled milling machine; a computer printer; an interactive modeling system; and a threedimensional photography system.
In an example embodiment the energy function is a quadratic energy function of the primal points and the dual points composed of a sum of square terms, each square term corresponding to one particular regular edge of the primal mesh connectivity, each square term being the square of a difference term, the difference term computed by subtracting the sum of the two dual points corresponding to the two primal mesh faces incident to the particular regular edge from the sum of the two primal points corresponding to the two primal mesh vertices joined by the edge. Note that the square term is the equal to four times the distance existing between the midpoints of a first and a second straight line segments in Ndimensional space, the first straight line segment joining the two primal points, the second straight line segment joining the two dual points. This process is guaranteed to minimize signal loss for the largest set of vertex position vectors. The mathematical details are explained in the paper “Dual Mesh Resampling,” by G. Taubin, Pacific Graphics Conference Proceedings, Tokyo, Japan, October 2001, which has been incorporated herein by reference in its entirety.
In a more advantageous embodiment the minimization of the quadratic energy function is performed using a least squares solver.
In another advantageous embodiment the minimization of the quadratic energy function is performed using a dual resampling algorithm.
In a further advantageous embodiment the stopping criterion is a maximum error tolerance, which is met when a distance between the dual mesh signal and the new dual mesh signal computed right after step 640 is smaller than the maximum error tolerance. In another embodiment the stopping criterion is a maximum number of iterations, which is met when the number of times that step 640 is executed exceeds the maximum number of iterations.
In some embodiment the stopping criterion is a combination of maximum error tolerance and maximum number of iterations, which is met when either one of the two criteria is satisfied.
Thus the invention may be implemented as a method including the steps of: obtaining a polygon mesh having at least one primal mesh signal and a polygon mesh connectivity; resampling the primal mesh signal to produce a dual mesh signal of the polygon mesh, including the steps of: using the polygon mesh connectivity to define an energy function relating the dual mesh signal with the primal mesh signal; and minimizing the energy function with respect to the dual mesh signal while keeping the primal mesh signal fixed to provide values for the dual mesh signal.
In some embodiments of the method the step of obtaining includes at least one of the following steps: reading an output from a computer program; reading from a computer memory buffer; reading from a display screen buffer; reading a computer file stored in a nonvolatile storage medium; reading a computer file stored in a magnetic storage device; reading a computer file stored in an optical storage device; reading a computer file stored in a computer network; scanning a document; multidimensional scanning from a physical object; drawing with an electronic tablet; constructing with an interactive modeling system; constructing with a computeraided design system; constructing with a computer animation system; reconstructing from multiple photographs; and using a threedimensional photography system.
In some embodiments of the method: the polygon mesh connectivity includes a plurality of polygon mesh vertices, a plurality of polygon mesh faces, and at least one regular edge, each polygon mesh face having at least three e corners, each corner being a particular polygon mesh vertex from among the plurality of polygon mesh vertices, each regular edge being incident to two polygon mesh vertices and two polygon mesh faces; the primal mesh signal includes a plurality of primal points, each primal point being a point in an Ndimensional space, each primal point corresponding to a particular polygon mesh vertex from among the plurality of polygon mesh vertices of the polygon mesh connectivity; the dual mesh signal includes a plurality of dual points, each dual point being a point in the Ndimensional space, each dual point corresponding to a particular polygon mesh face from among the plurality of polygon mesh faces of the polygon mesh connectivity; and the step of using defines the energy function as the sum of a plurality of square terms, each square term corresponding to a particular regular edge of the polygon mesh connectivity, the square term being the square of a difference term, the difference term being computed by subtracting the sum of two dual points from the sum of two primal points, the two dual points corresponding to the two polygon mesh faces to which the regular edge is incident, the two primal points corresponding to the two polygon mesh vertices to which the regular edge is incident; and/or the step of minimizing includes at least one step of: employing a least squares solver; and employing a dual resampling algorithm; and/or further including employing a dual resampling algorithm including the steps of: determining an iteration stopping criterion; computing a plurality of face barycenters of the polygon mesh, each face barycenter corresponding to a particular polygon mesh face from among the plurality of polygon mesh faces of the polygon mesh connectivity, each face barycenter being the average of the primal points corresponding to the corners of the polygon mesh face; initializing each of the dual points as equal to a corresponding face barycenter, both each of the dual points and corresponding face barycenter corresponding to the same polygon mesh face; recomputing each of the dual points as the sum of the corresponding face barycenter plus one half of a dual Laplacian displacement, the dual Laplacian displacement corresponding to the same polygon mesh face, wherein: the dual Laplacian displacement computed as the average of a plurality of dual point differences, each dual point difference corresponding to a particular regular edge of the polygon mesh connectivity, each dual point difference computed by subtracting the dual point from a neighbor dual point, and the neighbor dual point corresponding to a neighbor polygon mesh face, the particular regular edge being incident to the same polygon mesh face and the neighbor polygon mesh face; and repeating the step of recomputing until the iteration stopping criterion is met. In alternate embodiments of the method: the primal mesh signal includes at least one signal taken from a group of signals including: positions of mesh vertices in Ndimensional space; normal vectors used for shading; color vectors used for shading; and texture coordinates used to render textured polygon meshes; and/or the energy function measures at least one distance between primal and dual edges; and/or the stopping criterion includes at least one stopping criterion taken from a group of stopping criteria including: maximal error tolerance; and maximal number of iterations; and/or further including: constructing a dual mesh connectivity from the polygon mesh connectivity, wherein the dual mesh connectivity having a plurality of dual mesh vertices, a plurality of dual mesh faces, and a plurality of dual regular edges, each dual mesh vertex corresponding to one the polygon mesh face of the polygon mesh connectivity, each dual mesh face corresponding to one polygon mesh vertex of the polygon mesh connectivity, each dual regular edge corresponding to one particular regular edge of the polygon mesh connectivity; and combining the dual mesh signal and the dual mesh connectivity in forming a dual mesh; and/or further including recomputing the primal mesh signal by minimizing the energy function with respect to the primal mesh signal while keeping the dual mesh signal fixed to provide new values for the primal mesh signal; and/or further including repeating the steps of resampling and recomputing until a smoothing stopping criterion is met; and/or further including: constructing a primaldual mesh signal by concatenating the primal mesh signal with the dual mesh signal; constructing a primaldual mesh connectivity from the polygon mesh connectivity, wherein the primaldual mesh connectivity having a plurality of primaldual mesh vertices, and a plurality of primaldual mesh faces, each primaldual mesh face corresponding to one particular regular edge of the polygon mesh connectivity, each primadual mesh vertex corresponding to at least one of a particular polygon mesh vertex and a particular polygon mesh face of the polygon mesh connectivity; and constructing a primaldual mesh by combining the primaldual mesh signal and the primaldual mesh connectivity; and/or further including repeating the steps of constructing until a subdivision stopping criterion is met.
The invention also includes a method having the steps of: obtaining a polygon mesh, wherein: the polygon mesh including a primal mesh signal and a polygon mesh connectivity, the polygon mesh connectivity including a plurality of polygon mesh vertices, a plurality of polygon mesh faces, and at least one regular edge, each polygon mesh face having at least three corners, each corner being a particular polygon mesh vertex from among the plurality of polygon mesh vertices, each regular edge being incident to two polygon mesh vertices and two polygon mesh faces, the primal mesh signal including a plurality of primal points, each primal point being a point in an Ndimensional space, each primal point corresponding to a particular polygon mesh vertex from the plurality of polygon mesh vertices, resampling the polygon mesh to produce a dual mesh signal, the dual mesh signal including a plurality of dual points, each dual point being a point in the Ndimensional space, each dual point corresponding to a particular polygon mesh face from the plurality of polygon mesh faces; reading the polygon mesh from an input source; minimizing an energy function of the primal points and the dual points with respect to the dual points while the primal points are kept fixed, wherein: the energy function being a sum of a plurality of squares of terms, each square term being associated with a particular regular edge of the polygon mesh connectivity, the square term being the square of a difference term, the difference term being computed by subtracting the sum of two dual points from the sum of two primal points, the two dual points corresponding to the two mesh faces to which the regular edge is incident, and the two primal points corresponding to the two vertices to which the regular edge is incident; and writing the dual mesh signal to an output source.
In some embodiments of these methods the input source includes at least one input source from a group of input sources including: an output from a computer program; a computer memory buffer; a display screen buffer; a computer file stored in a nonvolatile storage medium; a computer file stored in a magnetic storage device; a computer file stored in an optical storage device; a computer file stored in a computer network; a document scanner; a threedimensional scanner; an electronic tablet; an interactive modeling system; and a threedimensional photography system; and/or further including in the output source at least one output source from a group of output sources including: an input to a computer program; a computer memory buffer; a display screen buffer; a computer file stored in a nonvolatile storage medium; a computer file stored in a magnetic storage device; a computer file stored in an optical storage device; a computer file stored in a computer network; a virtual prototyping machine; a numericallycontrolled milling machine; a computer printer; an interactive modeling system; and a threedimensional photography system; and/or the step of minimizing includes the steps of: computing a plurality of face barycenters of the polygon mesh, wherein: each face barycenter corresponds to a particular polygon mesh face from among the plurality of polygon mesh faces of the polygon mesh connectivity, and each face barycenter being the average of the primal points corresponding to the corners of the polygon mesh face; initializing each of the dual points to be equal to a corresponding face barycenter, wherein each of the dual points and a corresponding face barycenter correspond to a same polygon mesh face; recomputing each of the dual points as the sum of the corresponding face barycenter plus one half of a dual Laplacian displacement, wherein: the dual Laplacian displacement corresponding to the same polygon mesh face, the dual Laplacian displacement computed as the average of a plurality of dual point differences, each dual point difference corresponding to a particular regular edge of the polygon mesh connectivity, each dual point difference computed by subtracting the dual point from a neighbor dual point, the neighbor dual point corresponding to a neighbor polygon mesh face, and the particular regular edge being incident to the same polygon mesh face and the neighbor polygon mesh face; and repeating the steps of computing, initializing, and recomputing until an iteration stopping criterion is met.
Furthermore, the invention includes a method having the steps of: creating a dual polygon mesh from a polygon mesh, wherein: the polygon mesh including a primal mesh signal and a polygon mesh connectivity, the polygon mesh connectivity including a plurality of polygon mesh vertices, a plurality of polygon mesh faces, and at least one regular edge, each polygon mesh face having at least three corners, each corner being a particular polygon mesh vertex from among the plurality of polygon mesh vertices, each regular edge being incident to two polygon mesh vertices and two polygon mesh faces, the primal mesh signal including a plurality of primal points, each primal point being a point in an Ndimensional space, each primal point corresponding to a particular polygon mesh vertex from the plurality of polygon mesh vertices, the dual polygon mesh including a dual mesh signal and a dual mesh connectivity, the dual mesh signal including a plurality of dual points, each dual point being a point in the Ndimensional space, each dual point corresponding to a particular polygon mesh face from the plurality of polygon mesh faces, the dual mesh connectivity having a plurality of dual mesh vertices, and a plurality of dual mesh faces, each dual mesh vertex corresponding to one the polygon mesh face of the polygon mesh connectivity, each dual mesh face corresponding to one polygon mesh vertex of the polygon mesh connectivity; reading the polygon mesh from an input source; minimizing an energy function of the primal points and the dual points with respect to the dual points while the primal points are kept fixed, wherein: the energy function is a sum of a plurality of squares of terms, each square term being associated with a particular regular edge of the polygon mesh connectivity, the square term being the square of a difference term, the difference term being computed by subtracting the sum of two dual points from the sum of two primal points, the two dual points corresponding to the two mesh faces to which the regular edge is incident, and the two primal points corresponding to the two vertices to which the regular edge is incident; constructing the dual mesh connectivity from the polygon mesh connectivity; combining the dual mesh signal and the dual mesh connectivity as the dual polygon mesh; and writing the dual polygon mesh to an output source.
The invention also includes a method having the steps of: smoothing a polygon mesh, wherein: the polygon mesh includes a primal mesh signal and a polygon mesh connectivity, the polygon mesh connectivity including a plurality of polygon mesh vertices, a plurality of polygon mesh faces, and at least one regular edge, each polygon mesh face having at least three corners, each corner being a particular polygon mesh vertex from among the plurality of polygon mesh vertices, each regular edge being incident to two polygon mesh vertices and two polygon mesh faces, and the primal mesh signal including a plurality of primal points, each primal point being a point in an Ndimensional space, each primal point corresponding to a particular polygon mesh vertex from the plurality of polygon mesh vertices; and reading the polygon mesh from an input source; creating a temporary dual mesh signal, wherein the temporary dual mesh signal including a plurality of dual points, each dual point being a point in the Ndimensional space, each dual point corresponding to a particular polygon mesh face from the plurality of polygon mesh faces; minimizing an energy function of the primal points and the dual points with respect to the dual points while the primal points are kept fixed, wherein: the energy function is a sum of a plurality of squares of terms, each square term being associated with a particular regular edge of the polygon mesh connectivity, the square term being the square of a difference term, the difference term being computed by subtracting the sum of two dual points from the sum of two primal points, and the two dual points corresponding to the two mesh faces to which the regular edge is incident, the two primal points corresponding to the two vertices to which the regular edge is incident; recomputing the primal mesh signal by minimizing the energy function with respect to the primal points while the dual points are kept fixed; and writing the primal mesh to an output source.
The invention also includes a method having the steps of: refining a polygon mesh producing a primaldual mesh, wherein: the polygon mesh including a primal mesh signal and a polygon mesh connectivity, the polygon mesh connectivity including a plurality of polygon mesh vertices, a plurality of polygon mesh faces, and at least one regular edge, each polygon mesh face having at least three corners, each corner being a particular polygon mesh vertex from among the plurality of polygon mesh vertices, each regular edge being incident to two polygon mesh vertices and two polygon mesh faces, the primal mesh signal including a plurality of primal points, each primal point being a point in an Ndimensional space, each primal point corresponding to a particular polygon mesh vertex from the plurality of polygon mesh vertices; reading the polygon mesh from an input source; creating a temporary dual mesh signal, wherein the temporary dual mesh signal including a plurality of dual points, each dual point being a point in the Ndimensional space, each dual point corresponding to a particular polygon mesh face from the plurality of polygon mesh faces; minimizing an energy function of the primal points and the dual points with respect to the dual points while the primal points are kept fixed, wherein: the energy function being a sum of a plurality of squares of terms, each square term being associated with a particular regular edge of the polygon mesh connectivity, the square term being the square of a difference term, the difference term being computed by subtracting the sum of two dual points from the sum of two primal points, and the two dual points corresponding to the two mesh faces to which the regular edge is incident, the two primal points corresponding to the two vertices to which the regular edge is incident; constructing a primaldual mesh signal by concatenating the primal mesh signal with the dual mesh signal; constructing a primaldual mesh connectivity from the polygon mesh connectivity, wherein the primaldual mesh connectivity has a plurality of primaldual mesh vertices, and a plurality of primaldual mesh faces, each primaldual mesh face corresponding to one particular regular edge of the polygon mesh connectivity, each primadual mesh vertex corresponds to one of a particular polygon mesh vertex and a particular polygon mesh face of the polygon mesh connectivity; constructing the primaldual mesh by combining the primaldual mesh signal and the primaldual mesh connectivity; and writing the primaldual mesh to an output source.
The invention also includes a system for resampling a primal mesh signal to produce a dual mesh signal including: a computer with operating system, computer memory, input/output interface, and a central processing unit; and an application program executed by the central processing unit for resampling a primal mesh to produce a dual mesh signal, the polygon mesh including a primal mesh signal and a polygon mesh connectivity, the polygon mesh connectivity including a plurality of polygon mesh vertices, a plurality of polygon mesh faces, and at least one regular edge, each polygon mesh face having at least three corners, each corner being a particular polygon mesh vertex from among the plurality of polygon mesh vertices, each regular edge being incident to two polygon mesh vertices and two polygon mesh faces, the primal mesh signal including a plurality of primal points, each primal point being a point in an Ndimensional space, each primal point corresponding to a particular polygon mesh vertex from the plurality of polygon mesh vertices, the dual mesh signal including a plurality of dual points, each dual point being a point in the Ndimensional space, each dual point corresponding to a particular polygon mesh face from the plurality of polygon mesh faces, the application program including the computer implemented steps of: reading the polygon mesh from one of the computer memory and the peripheral device through the input/output interface; and minimizing an energy function of the primal points and the dual points with respect to the dual points while the primal points are kept fixed, wherein:
 the energy function is a sum of a plurality of squares of terms, each square term being associated with a particular regular edge of the polygon mesh connectivity, the square term being the square of a difference term, the difference term being computed by subtracting the sum of two dual points from the sum of two primal points, the two dual points corresponding to the two mesh faces to which the regular edge is incident, and the two primal points corresponding to the two vertices to which the regular edge is incident; and writing the dual mesh signal to computer memory or peripheral device through the input/output interface.
Furthermore, the invention also includes a system for resampling a polygon mesh to produce a dual polygon mesh including: a computer with operating system, computer memory, input/output interface, and a central processing unit; and an application program executed by the central processing unit for resampling a polygon mesh to produce a dual mesh, wherein: the polygon mesh connectivity includes a plurality of polygon mesh vertices, a plurality of polygon mesh faces, and at least one regular edge, each polygon mesh face having three or more corners, each corner being a particular polygon mesh vertex from among the plurality of polygon mesh vertices, each regular edge being incident to two polygon mesh vertices and two polygon mesh faces, the primal mesh signal including a plurality of primal points, each primal point being a point in an Ndimensional space, each primal point corresponding to a particular polygon mesh vertex from the plurality of polygon mesh vertices, the dual polygon mesh including a dual mesh signal and a dual mesh connectivity, the dual mesh signal including a plurality of dual points, each dual point being a point in the Ndimensional space, each dual point corresponding to a particular polygon mesh face from the plurality of polygon mesh faces, the dual mesh connectivity having a plurality of dual mesh vertices, and a plurality of dual mesh faces, each dual mesh vertex corresponding to one the polygon mesh face of the polygon mesh connectivity, each dual mesh face corresponding to one polygon mesh vertex of the polygon mesh connectivity, the application program including the computer implemented steps of: reading the polygon mesh from the computer memory or peripheral device through the input/output interface; minimizing an energy function of the primal points and the dual points with respect to the dual points while the primal points are kept fixed, the energy function being a sum of a plurality of squares of terms, each square term being associated with a particular regular edge of the polygon mesh connectivity, the square term being the square of a difference term, the difference term being computed by subtracting the sum of two dual points from the sum of two primal points, the two dual points corresponding to the two mesh faces to which the regular edge is incident, the two primal points corresponding to the two vertices to which the regular edge is incident; constructing the dual mesh connectivity from the polygon mesh connectivity; combining the dual mesh signal and the dual mesh connectivity as the dual polygon mesh; and writing the dual polygon mesh to the computer memory or peripheral device through the input/output interface.
The invention also includes a system for smoothing a polygon mesh to produce a smoothed polygon mesh including: a computer with operating system, computer memory, input/output interface, and a central processing unit; and an application program executed by the central processing unit for smoothing a polygon mesh to produce a smoothed polygon mesh signal, wherein: the polygon mesh including a primal mesh signal and a polygon mesh connectivity, the polygon mesh connectivity including a plurality of polygon mesh vertices, a plurality of polygon mesh faces, and at least one regular edge, each polygon mesh face having three or more corners, each corner being a particular polygon mesh vertex from among the plurality of polygon mesh vertices, each regular edge being incident to two polygon mesh vertices and two polygon mesh faces, the primal mesh signal including a plurality of primal points, each primal point being a point in an Ndimensional space, each primal point corresponding to a particular polygon mesh vertex from the plurality of polygon mesh vertices, including the computer implemented steps of: reading the polygon mesh from the computer memory or peripheral device through the input/output interface; creating a temporary dual mesh signal, the temporary dual mesh signal including a plurality of dual points, each dual point being a point in the Ndimensional space, each dual point corresponding to a particular polygon mesh face from the plurality of polygon mesh faces; minimizing an energy function of the primal points and the dual points with respect to the dual points while the primal points are kept fixed, the energy function being a sum of a plurality of squares of terms, each square term being associated with a particular regular edge of the polygon mesh connectivity, the square term being the square of a difference term, the difference term being computed by subtracting the sum of two dual points from the sum of two primal points, the two dual points corresponding to the two mesh faces to which the regular edge is incident, the two primal points corresponding to the two vertices to which the regular edge is incident; and recomputing the primal mesh signal by minimizing the energy function with respect to the primal points while the dual points are kept fixed; and writing the smoothed polygon mesh to the computer memory or peripheral device through the input/output interface.
The invention also includes a system for refining a polygon mesh to produce a primaldual mesh including: a computer with operating system, computer memory, input/output interface, and a central processing unit; and an application program executed by the central processing unit for refining a polygon mesh to produce a primaldual mesh including, wherein: the polygon mesh including a primal mesh signal and a polygon mesh connectivity, the polygon mesh connectivity including a plurality of polygon mesh vertices, a plurality of polygon mesh faces, and at least one regular edge, each polygon mesh face having three or more corners, each corner being a particular polygon mesh vertex from among the plurality of polygon mesh vertices, each regular edge being incident to two polygon mesh vertices and two polygon mesh faces, the primal mesh signal including a plurality of primal points, each primal point being a point in an Ndimensional space, each primal point corresponding to a particular polygon mesh vertex from the plurality of polygon mesh vertices, including the computer implemented steps of: reading the polygon mesh from the computer memory or peripheral device through the input/output interface; creating a temporary dual mesh signal, the temporary dual mesh signal including a plurality of dual points, each dual point being a point in the Ndimensional space, each dual point corresponding to a particular polygon mesh face from the plurality of polygon mesh faces; minimizing an energy function of the primal points and the dual points with respect to the dual points while the primal points are kept fixed, the energy function being a sum of a plurality of squares of terms, each square term being associated with a particular regular edge of the polygon mesh connectivity, the square term being the square of a difference term, the difference term being computed by subtracting the sum of two dual points from the sum of two primal points, the two dual points corresponding to the two mesh faces to which the regular edge is incident, the two primal points corresponding to the two vertices to which the regular edge is incident; and constructing a primaldual mesh signal by concatenating the primal mesh signal with the dual mesh signal; constructing a primaldual mesh connectivity from the polygon mesh connectivity, the primaldual mesh connectivity having a plurality of primaldual mesh vertices, and a plurality of primaldual mesh faces, each primaldual mesh face corresponding to one particular regular edge of the polygon mesh connectivity, each primadual mesh vertex corresponding to either one particular polygon mesh vertex or one particular polygon mesh face of the polygon mesh connectivity; constructing the primaldual mesh by combining the primaldual mesh signal and the primaldual mesh connectivity; and writing the primaldual mesh to the computer memory or peripheral device through the input/output interface.
The invention may be implemented as an apparatus including means for performing the steps of any method of this invention. It may also be implemented as a computer program product including a computer usable medium having computer readable program code means embodied therein for causing the results of a method of this invention. The computer readable program code means in the computer program product including computer readable program code means for causing a computer to effect the functions of a system or apparatus of this invention. It may be implemented as an article of manufacture including a computer usable medium having computer readable program code means embodied therein for causing the results of at least one method of this invention. The computer readable program code means in the article of manufacture including computer readable program code means for causing a computer to effect the steps of a method. It may be implemented as program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for causing at least one function of this invention. The method steps including the steps of a method of this invention.
Given this disclosure alternative equivalent embodiments will become apparent to those skilled in the art. These embodiments are also within the contemplation of the inventors. It is understood that other embodiments are possible that incorporate the principles of the invention and that the above disclosure is merely illustrative of such principles and is not intended to be limiting in any respect. Thus, the present invention can be realized in hardware, software, or a combination of hardware and software. A visualization tool according to the present invention can be realized in a centralized fashion in one computer system, or in a distributed fashion where different elements are spread across several interconnected computer systems. Any kind of computer system—or other apparatus adapted for carrying out the methods and/or functions described herein—is suitable. A typical combination of hardware and software could be a general purpose computer system with a computer program that, when being loaded and executed, controls the computer system such that it carries out the methods described herein. The present invention can also be embedded in a computer program product, which comprises all the features enabling the implementation of the methods described herein, and which—when loaded in a computer system—is able to carry out these methods.
Computer program means, or computer program, in the present context include any expression, in any language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after conversion to another language, code or notation, and/or reproduction in a different material form.
Thus, the invention includes an article of manufacture which comprises a computer usable medium having computer readable program code means embodied therein for causing a function described above. The computer readable program code means in the article of manufacture comprises computer readable program code means for causing a computer to effect the steps of a method of this invention. Similarly, the present invention may be implemented as a computer program product comprising a computer usable medium having computer readable program code means embodied therein for causing a a function described above. The computer readable program code means in the computer program product comprising computer readable program code means for causing a computer to effect one or more functions of this invention. Furthermore, the present invention may be implemented as a program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for causing one or more functions of this invention. The invention may be implemented as an apparatus performing the functions and/or steps of any method of this invention.
It is noted that the foregoing has outlined some of the more pertinent objects and embodiments of the present invention. This invention may be used for many applications. Thus, although the description is made for particular arrangements and methods, the intent and concept of the invention is suitable and applicable to other arrangements and applications. It will be clear to those skilled in the art that modifications to the disclosed embodiments can be effected without departing from the spirit and scope of the invention. For example other mesh resampling operators and/or operations may be implemented using the concepts of this invention. The described embodiments ought to be construed to be merely illustrative of some of the more prominent features and applications of the invention. Other beneficial results can be realized by applying the disclosed invention in a different manner or modifying the invention in ways known to those familiar with the art.
Claims (35)
Priority Applications (1)
Application Number  Priority Date  Filing Date  Title 

US10/270,831 US6943790B2 (en)  20021011  20021011  Dual mesh resampling 
Applications Claiming Priority (1)
Application Number  Priority Date  Filing Date  Title 

US10/270,831 US6943790B2 (en)  20021011  20021011  Dual mesh resampling 
Publications (2)
Publication Number  Publication Date 

US20040070586A1 US20040070586A1 (en)  20040415 
US6943790B2 true US6943790B2 (en)  20050913 
Family
ID=32069015
Family Applications (1)
Application Number  Title  Priority Date  Filing Date 

US10/270,831 Expired  Fee Related US6943790B2 (en)  20021011  20021011  Dual mesh resampling 
Country Status (1)
Country  Link 

US (1)  US6943790B2 (en) 
Cited By (5)
Publication number  Priority date  Publication date  Assignee  Title 

US20040108999A1 (en) *  20021210  20040610  International Business Machines Corporation  System and method for performing domain decomposition for multiresolution surface analysis 
US20040122635A1 (en) *  20020830  20040624  Fujitsu Limited  Conversion check device, conversion check method, and portable storage medium therefor 
US7200532B1 (en) *  20020614  20070403  University Of Kentucky Research Foundation  Subdivision surfacebased geometric modeling system 
US7339584B1 (en) *  20020529  20080304  Sandia Corporation  Method of generating a surface mesh 
US20080316202A1 (en) *  20070622  20081225  Microsoft Corporation  Direct manipulation of subdivision surfaces using a graphics processing unit 
Families Citing this family (38)
Publication number  Priority date  Publication date  Assignee  Title 

US7523396B2 (en) *  20030929  20090421  Autodesk, Inc.  Surface construction audit trail and manipulation 
US20050091016A1 (en) *  20030929  20050428  Autodesk, Inc.  Surface smoothing techniques 
US7561990B2 (en) *  20030929  20090714  Autodesk, Inc.  Interactive triangulated irregular network (TIN) surfaces design 
US7127104B2 (en) *  20040707  20061024  The Regents Of The University Of California  Vectorized image segmentation via trixel agglomeration 
US20060285150A1 (en) *  20050131  20061221  Searete Llc, A Limited Liability Corporation Of The State Of Delaware  Regional proximity for shared image device(s) 
US9489717B2 (en) *  20050131  20161108  Invention Science Fund I, Llc  Shared image device 
US8902320B2 (en)  20050131  20141202  The Invention Science Fund I, Llc  Shared image device synchronization or designation 
US9082456B2 (en)  20050131  20150714  The Invention Science Fund I Llc  Shared image device designation 
US9001215B2 (en)  20050602  20150407  The Invention Science Fund I, Llc  Estimating shared image device operational capabilities or resources 
US9910341B2 (en)  20050131  20180306  The Invention Science Fund I, Llc  Shared image device designation 
US9967424B2 (en) *  20050602  20180508  Invention Science Fund I, Llc  Data storage usage protocol 
US8606383B2 (en)  20050131  20131210  The Invention Science Fund I, Llc  Audio sharing 
US8681225B2 (en) *  20050602  20140325  Royce A. Levien  Storage access technique for captured data 
US9124729B2 (en)  20050131  20150901  The Invention Science Fund I, Llc  Shared image device synchronization or designation 
US20060187227A1 (en) *  20050131  20060824  Jung Edward K  Storage aspects for imaging device 
US20060187230A1 (en) *  20050131  20060824  Searete Llc  Peripheral shared image device sharing 
US20060274153A1 (en) *  20050602  20061207  Searete Llc, A Limited Liability Corporation Of The State Of Delaware  Third party storage of captured data 
US7920169B2 (en) *  20050131  20110405  Invention Science Fund I, Llc  Proximity of shared image devices 
US9325781B2 (en)  20050131  20160426  Invention Science Fund I, Llc  Audio sharing 
US7782365B2 (en) *  20050602  20100824  Searete Llc  Enhanced video/still image correlation 
US20060174203A1 (en) *  20050131  20060803  Searete Llc, A Limited Liability Corporation Of The State Of Delaware  Viewfinder for shared image device 
US9819490B2 (en)  20050504  20171114  Invention Science Fund I, Llc  Regional proximity for shared image device(s) 
US10003762B2 (en)  20050426  20180619  Invention Science Fund I, Llc  Shared image devices 
US7876357B2 (en) *  20050131  20110125  The Invention Science Fund I, Llc  Estimating shared image device operational capabilities or resources 
US20060190968A1 (en) *  20050131  20060824  Searete Llc, A Limited Corporation Of The State Of The State Of Delaware  Sharing between shared audio devices 
US9451200B2 (en) *  20050602  20160920  Invention Science Fund I, Llc  Storage access technique for captured data 
US20060170956A1 (en) *  20050131  20060803  Jung Edward K  Shared image devices 
US20060173972A1 (en) *  20050131  20060803  Searete Llc, A Limited Liability Corporation Of The State Of Delaware  Audio sharing 
US20060221197A1 (en) *  20050330  20061005  Jung Edward K  Image transformation estimator of an imaging device 
US9942511B2 (en)  20051031  20180410  Invention Science Fund I, Llc  Preservation/degradation of video/audio aspects of a data stream 
US20070203595A1 (en) *  20060228  20070830  Searete Llc, A Limited Liability Corporation  Data management of an audio data stream 
US9093121B2 (en)  20060228  20150728  The Invention Science Fund I, Llc  Data management of an audio data stream 
EP2014101B1 (en) *  20060419  20160224  Setred AS  Bandwidth improvement for 3d display 
US8558833B1 (en) *  20091014  20131015  Nvidia Corporation  System and method for symmetric parameterization of independently tessellated patches 
KR20120070131A (en) *  20101221  20120629  한국전자통신연구원  Apparatus and method for generating animation using capture of non rigid object 
US9454806B2 (en)  20140121  20160927  Nvidia Corporation  Efficient approximatenearestneighbor (ANN) search for highquality collaborative filtering 
US9558712B2 (en) *  20140121  20170131  Nvidia Corporation  Unified optimization method for endtoend camera image processing for translating a sensor captured image to a display image 
US9280831B1 (en) *  20141023  20160308  International Business Machines Corporation  Image segmentation 
Citations (1)
Publication number  Priority date  Publication date  Assignee  Title 

US5506947A (en)  19940922  19960409  International Business Machines Corporation  Curve and surface smoothing without shrinkage 

2002
 20021011 US US10/270,831 patent/US6943790B2/en not_active Expired  Fee Related
Patent Citations (1)
Publication number  Priority date  Publication date  Assignee  Title 

US5506947A (en)  19940922  19960409  International Business Machines Corporation  Curve and surface smoothing without shrinkage 
NonPatent Citations (8)
Title 

"A Signal Processing Approach to Fair Surface Design." G. Taubin, Siggraph '95 Conf Proceedings, Aug. 1995, pp. 351358. 
"Behavior of Recursive Division Surfaces Near Extraordinary Points", by D. Doo, and M. Sabin, CAD, vol. 10, pp. 356360, 1978. 
"Course 23: Subdivision for Modeling and Animation," by D. Zorin and P. Schroder (eds.), Siggraph 2000 Course Notes, Jul. 2000. 
"Dual Mesh Resampling," by G. Taubin, Pacific Graphics Conference Proceedings, Tokyo, Japan, Oct. 2001. 
"Recursively Generated BSpline Surfaces on Arbitrary Topological Meshes." by E Catmull and J Clark,CAD, vol. 10, pp. 350355, 1978. 
"Smooth Subdivision Surfaces Based on Triangles," by C. Loop, Master Thesis, Dept of Mathematics, University of Utah, Aug. "1987". 
"Square Root of 3 Subdivision," by L. Kobbelt, Siggraph 2000 Conference Proceedings, pp. 103112, Jul. 2000. 
Hoppe et al., Mesh Optimization, 1993, ACM SIGGRAPH, pp. 1926. * 
Cited By (9)
Publication number  Priority date  Publication date  Assignee  Title 

US7339584B1 (en) *  20020529  20080304  Sandia Corporation  Method of generating a surface mesh 
US7200532B1 (en) *  20020614  20070403  University Of Kentucky Research Foundation  Subdivision surfacebased geometric modeling system 
US20040122635A1 (en) *  20020830  20040624  Fujitsu Limited  Conversion check device, conversion check method, and portable storage medium therefor 
US7225112B2 (en) *  20020830  20070529  Fujitsu Limited  Conversion check device, conversion check method, and portable storage medium therefor 
US7129942B2 (en) *  20021210  20061031  International Business Machines Corporation  System and method for performing domain decomposition for multiresolution surface analysis 
US20070052706A1 (en) *  20021210  20070308  Martin Ioana M  System and Method for Performing Domain Decomposition for Multiresolution Surface Analysis 
US20040108999A1 (en) *  20021210  20040610  International Business Machines Corporation  System and method for performing domain decomposition for multiresolution surface analysis 
US20080316202A1 (en) *  20070622  20081225  Microsoft Corporation  Direct manipulation of subdivision surfaces using a graphics processing unit 
US7868885B2 (en) *  20070622  20110111  Microsoft Corporation  Direct manipulation of subdivision surfaces using a graphics processing unit 
Also Published As
Publication number  Publication date 

US20040070586A1 (en)  20040415 
Similar Documents
Publication  Publication Date  Title 

Jakob et al.  Instant fieldaligned meshes.  
Escobar et al.  A new approach to solid modeling with trivariate Tsplines based on mesh optimization  
Persson et al.  A simple mesh generator in MATLAB  
Lazarus et al.  Axial deformations: an intuitive deformation technique  
Zhao et al.  Fast surface reconstruction using the level set method  
Guennebaud et al.  Algebraic point set surfaces  
Loop et al.  Generalized Bspline surfaces of arbitrary topology  
Stam  Exact evaluation of CatmullClark subdivision surfaces at arbitrary parameter values  
Igarashi et al.  Smooth meshes for sketchbased freeform modeling  
Zhou et al.  Large mesh deformation using the volumetric graph laplacian  
Loop et al.  Approximating subdivision surfaces with gregory patches for hardware tessellation  
Joshi et al.  Harmonic coordinates for character articulation  
CA2299432C (en)  Texture mapping and other uses of scalar fields on subdivision surfaces in computer graphics and animation  
US6377865B1 (en)  Methods of generating threedimensional digital models of objects by wrapping point cloud data points  
Botsch et al.  Geometric modeling based on triangle meshes  
Winkler et al.  Multi‐scale geometry interpolation  
Zhang et al.  Single‐view modelling of free‐form scenes  
Alliez et al.  Recent advances in remeshing of surfaces  
US6057848A (en)  System for rendering high order rational surface patches  
JP4083238B2 (en)  Progressive mesh adaptive subdivision method and apparatus  
Porumbescu et al.  Shell maps  
Jun  A piecewise hole filling algorithm in reverse engineering  
Suzuki et al.  Subdivision surface fitting to a range of points  
Hall et al.  Adaptive polygonalization of implicitly defined surfaces  
Farin  A history of curves and surfaces 
Legal Events
Date  Code  Title  Description 

AS  Assignment 
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:TAUBIN, GABRIEL;REEL/FRAME:013399/0249 Effective date: 20021011 

FPAY  Fee payment 
Year of fee payment: 4 

REMI  Maintenance fee reminder mailed  
LAPS  Lapse for failure to pay maintenance fees  
STCH  Information on status: patent discontinuation 
Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362 

FP  Expired due to failure to pay maintenance fee 
Effective date: 20130913 