US7184039B2  Computerimplemented method for generating coarse level meshes for multiresolution surface editing  Google Patents
Computerimplemented method for generating coarse level meshes for multiresolution surface editing Download PDFInfo
 Publication number
 US7184039B2 US7184039B2 US09/852,906 US85290601A US7184039B2 US 7184039 B2 US7184039 B2 US 7184039B2 US 85290601 A US85290601 A US 85290601A US 7184039 B2 US7184039 B2 US 7184039B2
 Authority
 US
 United States
 Prior art keywords
 computer
 level mesh
 points
 mesh representation
 generator module
 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.)
 Active, expires
Links
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
Abstract
Description
This application claims priority from U.S. Provisional Patent Application Serial No. 60/203,158 filed May 9, 2000.
The invention relates generally to the field of computer graphics, and more specifically to generation of meshes representing surfaces of objects. The invention specifically provides a computer graphics system and computerimplemented method for generating a coarselevel mesh from a finelevel mesh, which may be used in multiresolution surface editing.
Generally, in computer graphics, objects are represented as surfaces, with the surfaces being represented by meshes. A mesh consists of a set of vertices, or points in threedimensional space, interconnected by edges. The edges define polygonal faces, which may be in the form of triangles, quadrilaterals, and so forth. In some computer graphic operations, it is desirable to generate a representation of a surface at a finer resolution than a current representation. There are several popular methodologies for generating a representation of a surface at a finer resolution than a current representation, including a CatmullClark surface subdivision methodology and a Loop surface subdivision methodology. In other operations, it can also be desirable to generate from a mesh representing a surface at one level of resolution, a mesh at a coarser resolution. A methodology for generating a representation of a surface at a coarser resolution than a current representation, and a methodology for generating such a surface representation, based on the Loop methodology, is described in D. Zorin, et al., “Interactive Multiresolution Mesh Editing, SIGGRAPH 1997, Computer Graphics Proceedings, pp. 259–268, particularly p. 262.
The methodology described in Zorin relies on a method for smoothing triangular meshes that is described in G. Taubin, “A signal processing approach to fair surface design,” SIGGRAPH 1995, Computer Graphics Conference Proceedings, pp. 351–358. Taubin's smoothing methodology consists of two linear filtering steps, the first being a lowpass filter step, followed by a highpass filter step. The highpass filter step is used to cancel out a meshshrinking effect that is induced by the lowpass filter step. The filtering operations described by Taubin have the problem that, as a consequence of the linearity of the filtering procedure, artifacts referred to as Gibbs ripples are introduced in the smoothed mesh as a result of discontinuities in the input mesh. When used in generating a coarse level mesh, Taubin's filtering produces Gibbs ripples at the places on the surface where the fine level mesh has sharp variations. Although Taubin's smoothing methodology may be configured with the help of parameters, no filter can play the role of an inverse of the Loop subdivision rule. Accordingly, in a multiresolution representation of a Loop subdivision surface, there will be redundant detail information.
The invention provides a new and improved system and method for generating a coarselevel mesh from a finelevel mesh, which may be used in multiresolution surface editing.
In brief summary, the invention provides an arrangement for generating a coarse (“j”) level mesh representing a surface, from a finer (“j+1”) level mesh surface representation. The arrangement includes an indicator value generator and a coarse level mesh generator. The indicator value generator, for respective ones of the points in the finer level mesh surface representation, evaluates an indicator function, the value indicating whether a subdivisioninverse filter methodology or a leastsquares optimization methodology is to be used to determine a position for the corresponding point in the coarse level mesh representation. The coarse level mesh generator determines, for each of the points that is to be provided in the coarse level mesh representation, a position in response to the position of the corresponding point in the finer level mesh representation, in accordance with the one of the subdivisioninverse filter methodology or leastsquares optimization methodology indicated by the indicator value generated by the indicator value generator.
This invention is pointed out with particularity in the appended claims. The above and further advantages of this invention may be better understood by referring to the following description taken in conjunction with the accompanying drawings, in which:
The processor module 11 generally includes a processor, which may be in the form of one or more microprocessors, a main memory, and will generally include one a mass storage subsystem including one or more disk storage devices. The memory and disk storage devices will generally store data and programs (collectively, “information”) to be processed by the processor, and will store processed data which has been generated by the processor. The term “memory and disk storage devices” can encompass any computer readable medium, such as a computer hard disk, computer floppy disk, computer readable flash drive, computerreadable RAM or ROM element or equivalent means of encoding digital information on a physical medium. The term “programs” can encompass any computer program product consisting of computerreadable program instructions encoded on a computer readable medium. The processor module includes connections to the operator input device(s) 12 and the display device(s) 13, and will receive information input by the operator through the operator input device(s) 12, process the input information, store the processed information in the memory and/or mass storage subsystem. In addition, the processor module can provide video display information, which can form part of the information obtained from the memory and disk storage device as well as processed data generated thereby, to the display device(s) for display to the operator. The processor module 11 may also include connections (not shown) to hardcopy output devices such as printers for facilitating the generation of hardcopy output, modems and/or network interfaces (also not shown) for connecting the system 10 to the public telephony system and/or in a computer network for facilitating the transfer of information, and the like.
The invention provides an arrangement for generating a coarselevel mesh from a finer level mesh. In the following, the fine level mesh will continue to be identified by index “j+1,” and the coarse level mesh will continued to be identified by index “j.” Before describing the operations performed by the finetocoarse mesh generating arrangement in connection with generating a coarse level mesh from a current representation, it would be helpful to describe two surface subdivision methodologies, namely the aforementioned Loop surface subdivision methodology and a CatmullClark surface subdivision methodology, which are used to generate a finer (“j+1) level mesh from a coarse (“j”) level mesh. The invention provides an arrangement for essentially performing, in the case of a triangular mesh, operations that generally provide the inverse of Loop's surface subdivision methodology, and, in the case of a quadrilateral mesh, operations that generally provide the inverse of the CatmullClark surface subdivision methodology.
Loop's surface subdivision methodology will be described in connection with
and points v′_{q}(1) 22(1) at positions c^{j+1}(1) that are determined by
where the weighting factor a(K) is given by
Equations (1) and (2) are applied by selecting each point in the mesh at level “j” as a vertex, to provide points for the mesh at level “j+1.” Loop's surface subdivision methodology can be applied recursively to provide a mesh at any desired degree of fineness. It will be appreciated that equation (2) will provide that the point v′_{q}(1) 22(1) that is created when the methodology is applied to point v_{q }21(0) as the vertex will be in the same position when the methodology is applied to point v_{q}(k) 21(k) as the vertex.
It will be appreciated that, the Loop surface subdivision methodology provides
(i) one new point, at location c^{j+1}(1) in the finer (“j+1”) level mesh, for, and generally somewhere between, each pair of points in the coarse (“j”) level mesh, and
(ii) a relocated point, at location c^{j+1}(q) in the finer (“j+1”) level mesh for, and generally somewhat near, each point in the coarse (“j”) level mesh,
which are interconnected to form the finer (“j+1) level mesh. Accordingly, in performing the inverse, that is, processing a finer (“j+1”) level mesh to generate a coarse (“j”) level mesh, the arrangement processes the points in the finer (“j+1”) level mesh to remove, for each pair of connected points in the finer (“j+1”) level mesh, and determines a position for the remaining point, which will be present in the coarse (“j”) level mesh, based on the positions of surrounding points in the finer (“j+1”) level mesh. The operations performed by the arrangement in determining the position of the point that is to remain in the coarse (“j”) level mesh will be described below.
The CatmullClark subdivision methodology produces smooth surfaces using a small number of neighboring vertices. The CatmullClark surface subdivision methodology will be described in connection with
(i) a face point generation iteration, in which, for each face, a face point 33(1) through 33(4) is generated as the average of the points 32(p) defining the respective face (reference
(ii) an edge point generation iteration in which, for each edge, a new edge point 34(1) through 34(4) is generated as the average of the midpoint of the original edge with the two new face points of the faces adjacent to the edge (reference
(iii) a vertex point iteration in which a vertex point 35 is generated in relation to the positions of the new face points generated in iteration (i) for faces that are adjacent to the original vertex point, the positions of the midpoints of the original edges that are incident on the original vertex point, the position of the original vertex point, and the valence of the original vertex point (reference
(iv) a mesh connection step (reference
(a) each new face point is connected to the edge points of the edges defining the original face; and
(b) each new vertex point is connected to the new edge points of all original edges incident on the original vertex point.
More specifically, in the CatmullClark subdivision methodology, denoting, for a vertex v_{q }at location c^{j}(q),
(i) the set of indices of neighboring points c^{j}(1) that are connected thereto (for example, for point 32(0), point 32(2) and 32(8)) by N_{e}(q,j), and
(ii) the set of indices of secondorder neighboring points that are opposite to vertex c^{j}(q) with respect to the level “j” faces (for example, for point 32(0), point 32(1)) that are incident with vertex c^{j}(q) by N_{f}(q,j)
a mesh at the next higher fineness level “j+1” is constructed as follows. In the face point generation iteration, the face points are generated and located at positions c^{j+1}(m_{i}) determined as follows
In the edge point generation iteration, the edge points are generated and located at positions c^{j+1}(1_{i}) determined as follows:
In the vertex point generation iteration, the new vertex points are generated and located at positions as follows:
In terms of only points c^{j}, that is substituting for the last term in equation (6),
Generally, for quadrilateral meshes, the arrangement makes use of the CatmullClark methodology, except for the case of K=3 in equation (6). In that case, the arrangement makes use of
where
Equation (8) would correspond to the CatmullClark methodology (equation (6)) with
except that, for K=3,
instead of 1/12. In terms of only points c^{j }(compare equation (7))
As is apparent from the above discussion, the CatmullClark surface subdivision methodology applied to a quadrilateral mesh at the coarse (“j”) level will produce a quadrilateral mesh at the finer (“j+1”) level having the same number of points as the mesh at the coarse (“j”) level, but the points in the finer (“j+1”) level may be at different positions than in the coarse (“j”) level. Accordingly, in performing the inverse, that is, processing a finer (“j+1”) level mesh to generate a coarse (“j”) level mesh, the arrangement processes the points in the finer (“j+1”) level mesh determine a position for each point in the finer (“j+1”) level mesh based on the positions of surrounding points in the finer (“j+1”) level mesh. The operations performed by the arrangement in determining the position of the point in the coarse (“j”) level mesh will be described below.
As noted above, the invention provides an arrangement for generating a coarse (“j) level mesh from a finer (“j+1”) level mesh. In generating a coarse mesh from a fine mesh, an indicator function is used locally in connection with each point that is being processed as a vertex to determine whether, around the respective point, the fine mesh can be derived by subdivision of a coarser mesh using a subdivision inverse filter. If so, the value of the indicator function, which will be described below, will be “zero” or close to “zero.” On the other hand, if the fine mesh cannot be derived by subdivision of a coarser mesh in the region around the respective vertex using a subdivision inverse filter, the value of the indicator function will not be close to “zero,” and in that case the coarse mesh will be generated using an approximate solution of a leastsquares problem.
The indicator function is constructed for each point, selected as a vertex v′_{q}, using the value of the Laplacian L(k,j+1) of the positions of the point and of the other points in its neighborhood in the finer (j+1) level mesh. For triangular meshes, in the onedimensional case, for example, for a vertex v′_{q }on a boundary, crease line or the like in the finer (“j+1”) level mesh, the Laplacian for the vertex is
where c^{j+1}(k) is the position of the vertex v′_{q }in the finer (“j+1) level mesh for which the Laplacian is being generated, and c^{j+1}(k−1) and c^{j+1}(k+1) are the positions of the neighboring points v′_{q}(k−1) and v′_{q}(k+1) in the fine (j+1) level mesh. In the twodimensional case, that is, in the case of a vertex v′_{q }other than on a boundary, crease line or the like, for a regular vertex, that is, for a vertex for which the valence “K” is equal to “six,” the Laplacian is
where the factor “⅙” reflects the valence of the vertex. Also in the twodimensional case, for an irregular vertex, that is, for a vertex for which the valence “K” is not equal to “six,” which may be the case at, for example, edges of the mesh, the Laplacian is
where a(K) is defined in equation (3) above.
For quadrilateral meshes, in the onedimensional case, that is, for a vertex v′_{q }on a boundary, crease line, or the like in the finer (“j+1”) level mesh, the Laplacian L(k,j+1) for the vertex v′_{q }is
where c^{j+1}(k) is the position of the vertex v′_{q }for which the Laplacian is being generated in the finer (“j+1”) level mesh, and c^{j+1}(k−1) and c^{j+1}(k+1) are the positions of the neighboring points in the finer (j+1) level mesh. In the twodimensional case, that is, in the case of a vertex v′_{q }other than on a boundary, crease line or the like, two Laplacians are used, namely a Laplacian L_{e}(k,j+1) using the position c^{j+1}(k) of the vertex v′_{q }and the positions of the points whose indices are in the set N_{e}(q,j), and a Laplacian L_{f}(k,j+l) using the position c^{j+1}(k) and the positions of the vertices whose indices are in the set N_{f}(q,j), as follows
As will be described below, the arrangement makes use of values of both Laplacians L_{e}(k,j+1) and L_{f}(k,j+1), and so both values will be generated for each vertex.
As noted above, the arrangement makes use of an indicator function. For triangular meshes, the indicator function i(q) for a point as vertex v′_{q }is given by, in the onedimensional case
and, for the twodimensional case
where the indices for the sums in equation (18) are in the neighborhood of the vertex for which the indicator function is being evaluated are as depicted in
In generating the values of the indicator function for quadrilateral meshes, the arrangement makes use of a linear combination L_{ind}(k,j+1) of the Laplacians L_{e}(k,j+1) and L_{f}(k,j+1) described above (equations (15) and (16), respectively), namely
for vertices for which valence “K” is not equal to “three.” For vertices for which the valence “K” does equal “three,” L_{ind}(k,j+1) takes the form
For regular vertices, that is, for vertices for which the valence “K” equals “four,” equation (19) becomes
With this background, the indicator function i(k) for quadrilateral meshes is given by (omitting the index “j+1,” since the indicator function will always be evaluated for vertices in the fine (j+1) level mesh)
where the vertex neighborhoods for the respective sums are as shown in
As noted above, the finetocoarse mesh generating arrangement generates a coarse (“j”) level mesh from a finer (“j+1”) level mesh. For a triangular mesh, the finetocoarse mesh generating arrangement determines, for each vertex v′_{q }located at position c^{j+1}(k) in the finer (“j+1”) level mesh for which a vertex v_{q }is to appear in the coarse (“j”) level mesh, a position c^{j}(k) for the vertex v_{q }in accordance with
c ^{j}(k)=c ^{j+1}(k)+λL(k, j+1) (23),
where λ is a parameter whose value are determined as described below and L(k,j+1) is the value of the Laplacian generated for the vertex v′_{q }in the finer (j+1) level mesh. As noted above, not all of the vertices in the finer (“j+1”) level mesh will have corresponding vertices in the coarse (“j”) level mesh. If the value of the Laplacian L(k,j+1) generated for a vertex v′_{q }in the finer (“j+1”) level mesh is relatively small, that is, if
L(k,j+1)<ε (24)
for a selected small ε, then for equation (23), the position c^{j}(k) of the corresponding vertex v_{q }in the coarse (“j”) level mesh can be taken as the position c^{j+1}(k) of the vertex v′_{q}. In that case, neither the parameter λ, nor the indicator function i(q) (equations (17) and (18)), need to be generated.
If the value of the Laplacian L(k,j+1) is not small, that is, if the condition in equation (24) does not hold, the manner in which parameter λ for use in equation (23) is to be determined will depend on the value of the indicator function, generated as described above in connection with equations (17) and (18) and whether the vertex is on a boundary, crease line or the like, a regular vertex (that is, a vertex v′_{q }whose valence “K” is “six”) or an irregular vertex (that is, a vertex v′_{q }whose valence “K” is other than “six”). If the value of the indicator function is zero, or close to zero, for the vertex v′_{q}, a subdivisioninverse filter is used in which
(i) if the vertex is on a boundary, crease line or the like
λ=−1 (25),
(ii) if the vertex v′_{q }is regular, that is, if its valence “K” is equal to “six,” and is not on a boundary, crease line or the like
and
(iii) if the vertex v′_{q }is irregular, that is, if its valence “K” is not equal to “six,” and is not on a boundary, crease line or the like
where a(K) is as defined above in connection with equation (3).
On the other hand, if the value of the indicator function i(q) is not zero or close to zero, a leastsquares optimization is used in which
(i) if the vertex is on a boundary, crease line or the like
(ii) if the vertex v′_{q }is regular, that is, if its valence “K” is equal to “six,” and the vertex is not on a boundary, crease line or the like
where
it will be appreciated that the factor “⅙” in equation (29) reflects the value of the valence “K,” namely, “six.”
(iii) if the vertex v′_{q }is irregular, that is, if its valence “K” is not equal to “six,” and the vertex is not on the boundary, crease line or the like
where, for both equations (31) and (32), “K” corresponds to the valence of the irregular vertex, and a(K) is as defined in equation (3).
For a quadrilateral mesh, for each vertex v′_{q }located at position c^{j+1}(k) in the finer (+1) level mesh, a vertex v_{q }is provided in the coarser (j) level mesh at a position c^{j}(k) that is determined by
c ^{j}(k)=c ^{j+1}(k)+λ_{1} L _{e}(k,j+1)+λ_{2 } L _{f}(k,j+1) (33),
where λ_{1 }and λ_{2 }are parameters whose values are determined as described below, and L_{e}(k,j+1) and L_{f}(k,j+1) are determined as described above in connection with equations (14) through (16). In the onedimensional case, that is, for vertices on a boundary, crease line or the like, since only Laplacian L_{e }is used, only one parameter λ_{1 }need be generated for use in equation (33). On the other hand for vertices that are not on a boundary, crease line, or the like, since both Laplacians L_{e }and L_{f }are used, both parameters λ_{1 }and λ_{2 }are generated for use in equation (33). As with the triangular mesh, if the values of L_{e}(k,j+1) and L_{f}(k,j+1) are relatively small, that is, if for a vertex v′_{q }in the fine (“j+1”) level mesh
max(L _{e}(k,j+1), L _{f}(k,j+1))<ε (34)
for a selected small ε, then for equation (34), the position c^{j}(k) of vertex v_{q }in the coarse (“j”) level mesh can be taken as the position c^{j+1}(k) of vertex v′_{q}. In that case, neither the parameters λ_{1 }and λ_{2}, nor the indicator function i(k,j+1) (equation (22)), need to be generated.
If the condition in equation (34) does not hold, the values of parameter λ_{1 }and λ_{2 }for use in equation (33) will depend on the value of the indicator function. For a vertex v′_{q }that falls on a boundary, crease line or the like, the value of the parameter λ_{1 }will be generated in the same manner as in a triangular mesh (reference equations (25) and (28) above). On the other hand, for a vertex v′_{q }that does not fall on a boundary, crease line or the like, if the value of the indicator function i(k,j+1) generated therefor is near zero, that is, if
i(k,j+1)≦ε·max(L _{e}(k,j+1), L _{f}(k,j+1)) (35)
a subdivisioninverse filter is used in which, if the valence “K” of the vertex not equal to “three,”
and, if the valence “K” for the vertex is equal to “three,”
λ_{1}=−8, λ_{2}=2 (37).
On the other hand, if, for a vertex v′_{q}, the value of the indicator function i(k,j+1) is not near zero, that is, if the condition in inequality (35) is not satisfied,
which reflect a least squares optimization. If vertex v′_{q }is regular, that is, if the vertex's valence “K” is “four,”
On the other hand, if the vertex v′_{q }is irregular, that is, if the vertex's valence “K” is other than “four,”
The following are approximations for equations (40) that are used in one embodiment of the arrangement:
b_{10} ^{cc}=−2.04583
b_{11} ^{cc}=−2.5284
b_{20} ^{cc}=1.69069
b_{21} ^{cc}=−1.37687 (42),
and the following are approximations for equations (41) that are used in the same embodiment:
With this background, the operations performed by the finetocoarse mesh generating arrangement in generating a coarse (“j”) level mesh from a finer (“j+1”) level mesh will be described in connection with the flow charts in
On the other hand, if the arrangement makes a negative determination in step 101, it will determine whether the point is irregular, that is, whether its valence “K” is less than six and does not fall on a boundary, crease line or the like (step 103). If the arrangement makes a positive determination in step 103, it proceeds to step 104 in which it generates the Laplacian for the point selected in step 100 in accordance with equation (12).
Finally, if the arrangement makes a negative determination in step 103, which will be the case if the point falls on a boundary, crease line or the like, it proceeds to step 105 in which it generates the Laplacian for the point selected in step 100 in accordance with equation (10).
Following step 102, 104 or 105, the arrangement will determine whether all of the points have been selected in step 100 (step 106). If the arrangement makes a negative determination in step 106, it will not have generated Laplacians for all of the points in the finer (“j+1”) level mesh, and, in that case, it will return to step 100 to select another point and perform respective steps 101 through 105 in connection therewith. The arrangement performs step 100 and respective steps 101 through 105 through a plurality of iterations, in each iteration selecting and generating the Laplacian for each of the points in the finer (“j+1”) level mesh.
After all of the points have been selected and Laplacians generated therefor, the arrangement will make a positive determination in step 106, at which point it will sequence to a series of steps in which the arrangement determines the positions c^{j}(q) for points in the finer (“j+1”) level mesh that are to be retained in the coarse (“j”) level mesh. In those operations, the arrangement will select a point in the finer (“j+1”) level mesh (step 110) and determine whether the point is to be retained in the coarse (“j”) level mesh (step 111). If the arrangement makes a negative determination in step 111, the point is not to be retained in the coarse (“j”) level mesh. In that case, the arrangement will sequence to a step 112 in which it determines whether it has selected all of the points in the finer (“j+1”) level mesh. If the arrangement makes a negative determination in step 112, it will return to step 110 to select another point in the finer (“j+1”) level mesh. On the other hand, if the arrangement makes a positive determination in step 112, which will be the case if it has processed all of the points in the finer (“j+1”) level mesh, it will exit (step 113). The arrangement can make use of any of a number of methodologies in determining whether a point in the finer (“j+1”) level mesh will be retained in the coarse (“j”) level mesh. For example, given a suitable point indexing methodology, as will be apparent to those skilled in the art, the arrangement can determine whether a point in the finer (“j+1”) level mesh will be retained in the coarse (“j”) level mesh.
Returning to step 111, if the arrangement makes a positive determination in that step, which will be the case if the selected point in the finer (“j+1”) level mesh will be retained, the arrangement sequences to step 115, in which it determines whether the value of the Laplacian for the point selected in step 110 is less than “ε” (reference inequality (24)). If the arrangement makes a positive determination in step 115, it determines the position c^{j}(q) of the point in the coarse (“j”) level mesh as the position c^{j+1}(q) of the corresponding point in the finer (“j+1”) level mesh (step 116). Following step 116, the arrangement will sequence to step 112 to determine whether all of the points in the finer (“j+1”) level mesh have been processed, and, if not, return to step 110 to select another point, and, if so, exit.
Returning to step 115, if the arrangement makes a negative determination in that step, it will sequence to step 117, in which it will determine whether the point is regular, that is, whether its valence “K” is six, and does not fall on a boundary, crease line or the like. If the arrangement makes a positive determination in that step, it will generate a value for the indicator function (reference equation (18)) (step 118). The arrangement will then determine whether the value of the indicator function is zero or close to zero (step 119). If the arrangement makes a positive determination in step 119, it will provide a value for the parameter λ as described above in connection with equation (26) (step 120). On the other hand, if the arrangement makes a negative determination in step 119, it will provide a value for the parameter λ as described above in connection with equation (29), provided that the value of the parameter λ does not fall below the value specified in equation (26) (step 121).
Returning to step 117, if the arrangement makes a negative determination in that step, it will sequence to step 122 to determine whether the point is irregular, that is, whether its valence “K” is not equal to six, and the point does not fall on a boundary, crease line or the like. If the arrangement makes a positive determination in that step, it will generate a value for the indicator function (reference equation (18)) (step 123). The arrangement will then determine whether the value of the indicator function is zero or close to zero (step 124). If the arrangement makes a positive determination in step 124, it will provide a value for the parameter λ as described above in connection with equation (27) (step 125). On the other hand, if the arrangement makes a negative determination in step 124, it will provide a value for the parameter λ as described above in connection with equation (30), provided that the value of the parameter λ does not fall below the value specified in equation (26) (step 126).
Returning to step 122, if the arrangement makes a negative determination in that step, it will sequence to step 127 to determine whether the point falls on a boundary, crease line or the like. If the arrangement makes a positive determination in that step, it will generate a value for the indicator function (reference equation (17)) (step 128). The arrangement will then determine whether the value of the indicator function is zero or close to zero (step 129). If the arrangement makes a positive determination in step 129, it will provide a value for the parameter λ as described above in connection with equation (25) (step 130). On the other hand, if the arrangement makes a negative determination in step 129, it will provide a value for the parameter λ as described above in connection with equation (28), provided that the value of the parameter λ does not fall below the value specified in equation (25) (step 131).
Following step 120, 121, 125, 126, 130, or 131, the arrangement will sequence to step 132, in which it determines whether the value of the parameter λ generated in the respective step was greater than “one,” and, if so, limit the maximum value of parameter λ to “one” (step 133). Thereafter, the arrangement uses equation (23) to determine the position c^{j+1}(q) of the point in the coarse (“j”) level mesh (step 134).
Following step 134, the arrangement the arrangement will sequence to step 112 to determine whether all of the points in the finer (“j+1”) level mesh have been processed, and, if not, return to step 110 to select another point, and, if so, exit.
The flow chart in
On the other hand, if the arrangement makes a negative determination in step 151, which will be the case if the point falls on a boundary, crease line or the like, it proceeds to step 153 in which it generates the Laplacian for the point selected in step 150 in accordance with equation (14).
Following step 152 or 153, the arrangement will determine whether all of the points have been selected in step 150 (step 154). If the arrangement makes a negative determination in step 154, it will not have generated Laplacians for all of the points in the finer (“j+1”) level mesh, and, in that case, it will return to step 150 to select another point and perform respective steps 151 through 153 in connection therewith. The arrangement performs step 150 and respective steps 151 through 153 through a plurality of iterations, in each iteration selecting and generating the Laplacian for each of the points in the finer (“j+1”) level mesh.
After all of the points have been selected and Laplacians generated therefor, the arrangement will make a positive determination in step 154, at which point it will sequence to a series of steps in which the arrangement determines the positions c^{j}(q) for respective points in the coarse (“j”) level mesh using the positions c^{j+1}(q) of the points in the finer (“j+1”) level mesh and the values of parameters to be generated and the Laplacians generated in steps 150 through 153. Initially, the arrangement will select a point in the finer (“j+1”) level mesh (step 160) and determine whether the values of both Laplacians L_{e}(k,j+1) and L_{f}(k,j+1) generated for the point selected instep 160 are less than “ε” (reference inequality (34)) (step 161). If the arrangement makes a positive determination in step 161, it determines the position c^{j}(q) of the point in the coarse (“j”) level mesh as the position c^{j+1}(q) of the same point in the finer (“j+1”) level mesh (step 162). Following step 162, the arrangement will sequence to step 163 to determine whether all of the points in the finer (“j+1”) level mesh have been processed, and, if not, return to step 160 to select another point. On the other hand, if the arrangement makes a positive determination in step 163, it will exit (step 164).
Returning to step 161, if the arrangement makes a negative determination in that step, it will sequence to step 165, in which it determines whether the determine whether the point is regular, that is, whether its valence “K” is four, and does not fall on a boundary, crease line or the like. If the arrangement makes a positive determination in step 165, it will generate a value for the indicator function (reference equation (22)) (step 166) and determine whether the value of the indicator function is near zero (reference inequality (35)) (step 167). If the arrangement makes a positive determination in step 167, it will generate values for λ_{1 }and λ_{2 }as described above in connection with equations (36) (step 168). On the other hand, if the arrangement makes a negative determination in step 167, it will generate values for λ_{1 }and λ_{2 }as described above in connection with equations (38)–(40), in the process ensuring that the values of λ_{1 }and λ_{2 }are within predetermined limits (−4≦λ_{1}≦½, ¼≦λ_{2}<1) (step 169).
Returning to step 165, if the arrangement makes a negative determination in that step, it will sequence to step 170, in which it determines whether the point is irregular, that is, whether its valence “K” is other than four, and does not fall on a boundary, crease line or the like. If the arrangement makes a positive determination in step 170, it will generate a value for the indicator function (reference equation (22)) (step 171) and determine whether the value of the indicator function is near zero (reference inequality (35)) (step 172). If the arrangement makes a positive determination in step 172, it determine whether the valence “K” of the point is “three” (step 173). If the arrangement makes a positive determination in step 173, it will generate values for λ_{1 }and λ_{2 }as described above in connection with equation (37) (step 174). On the other hand, if the arrangement makes a negative determination in step 173, it will generate values for λ_{1 }and λ_{2 }as described above in connection with equation (36) (step 175). Returning to step 172, if the arrangement makes a negative determination in step 172, which will be the case if the value for the indicator function as generated in step 171 is not near zero, it will generate values for λ_{1 }and λ_{2 }as described above in connection with equations (38)–(40), in the process ensuring that the values of λ_{1 }and λ_{2 }are within predetermined limits
(step 176).
Returning to step 170, if the arrangement makes a negative determination in that step, it will sequence to step 177 to determine whether the point falls on a boundary, crease line or the like. If the arrangement makes a positive determination in that step, it will generate a value for the indicator function (reference equation (17)) (step 178). The arrangement will then determine whether the value of the indicator function is zero or near zero (reference inequality (35) above) (step 179). If the arrangement makes a positive determination in step 179, it will provide a value for the parameter λ as described above in connection with equation (25) (step 180). On the other hand, if the arrangement makes a negative determination in step 179, it will provide a value for the parameter λ as described above in connection with equation (28) (step 181).
Following step 168, 169, 174, 175, 180, or 181, the arrangement will sequence to step 182, in which it uses equation (33) and values for parameters λ_{1 }and λ_{2 }generated in the previous steps to determine the position c^{j+1}(q) of the point in the coarse (“j”) level mesh. Following step 182, the arrangement will sequence to step 163 to determine whether all of the points in the finer (“j+1”) level mesh have been processed, and, if not, return to step 160 to select another point, and, of so, sequence to step 164 to exit.
The arrangement provides a number of advantages. In particular, the invention provides an arrangement for generating a coarse (“j”) level mesh representing a surface, from a finer (“j+1”) level mesh surface representation. The arrangement makes use of an indicator function to provide an indication as to which of several methodologies is be used at respective ones of the points in the finer (“j+1”) level mesh, including a subdivisioninverse filter methodology and a leastsquares optimization methodology.
It will be appreciated that numerous changes and modifications may be made to the arrangement as described herein. For example, it will be appreciated that, although the arrangement has been described in connection with meshes of triangular and quadrangular faces, it will be appreciated that the arrangement may find utility in connection with meshes having faces of different polygonal structures. In addition, although equations for generating the indicator functions and parameters may differ than the specific ones described herein.
It will be appreciated that a system in accordance with the invention can be constructed in whole or in part from special purpose hardware or a general purpose computer system, or any combination thereof, any portion of which may be controlled by a suitable program. Any program may in whole or in part comprise part of or be stored on the system in a conventional manner, or it may in whole or in part be provided in to the system over a network or other mechanism for transferring information in a conventional manner. In addition, it will be appreciated that the system may be operated and/or otherwise controlled by means of information provided by an operator using operator input elements (not shown) which may be connected directly to the system or which may transfer the information to the system over a network or other mechanism for transferring information in a conventional manner.
The foregoing description has been limited to a specific embodiment of this invention. It will be apparent, however, that various variations and modifications may be made to the invention, with the attainment of some or all of the advantages of the invention. It is the object of the appended claims to cover these and such other variations and modifications as come within the true spirit and scope of the invention.
Claims (16)
c ^{j}(k)=c ^{j}+1(k)+λ L(k,j+1)
c ^{j}(k)=c ^{j+1}(k)+λ L(k,j+1)
c ^{j}(k)=c ^{j+1}(k)+λ L(k,j+1)
c ^{j}(k)=c ^{j+1}(k)+λ L(k,j+1)
c ^{j}(k)=c ^{j+1}(k)+λ _{1 } L _{e}(k,j+1)+λ _{2 } L _{f}(k,j+1)
c ^{j}(k)=c ^{j+1}(k)+λ L(k,j+1)
c ^{j}(k)=c ^{j}+1(k)+λ L(k,j+1)
c ^{j}(k)=c ^{j+1}(k)+λ L(k,j+1)
c ^{j}(k)=c ^{j+1}(k)+λ L(k,j+1)
c ^{j}(k)=c ^{j}+1(k)+λ _{1 } L _{e}(k,j+1)+λ _{2 } L _{f}(k,j+1)
Priority Applications (2)
Application Number  Priority Date  Filing Date  Title 

US20315800P true  20000509  20000509  
US09/852,906 US7184039B2 (en)  20000509  20010509  Computerimplemented method for generating coarse level meshes for multiresolution surface editing 
Applications Claiming Priority (3)
Application Number  Priority Date  Filing Date  Title 

US09/852,906 US7184039B2 (en)  20000509  20010509  Computerimplemented method for generating coarse level meshes for multiresolution surface editing 
US11/623,883 US7453457B2 (en)  20000509  20070117  Computer graphics using coarse level meshes 
US12/271,963 US20090146998A1 (en)  20000509  20081117  Computer graphics using coarse level meshes 
Related Child Applications (1)
Application Number  Title  Priority Date  Filing Date 

US11/623,883 Continuation US7453457B2 (en)  20000509  20070117  Computer graphics using coarse level meshes 
Publications (2)
Publication Number  Publication Date 

US20050276518A1 US20050276518A1 (en)  20051215 
US7184039B2 true US7184039B2 (en)  20070227 
Family
ID=22752754
Family Applications (3)
Application Number  Title  Priority Date  Filing Date 

US09/852,906 Active 20240917 US7184039B2 (en)  20000509  20010509  Computerimplemented method for generating coarse level meshes for multiresolution surface editing 
US11/623,883 Active US7453457B2 (en)  20000509  20070117  Computer graphics using coarse level meshes 
US12/271,963 Abandoned US20090146998A1 (en)  20000509  20081117  Computer graphics using coarse level meshes 
Family Applications After (2)
Application Number  Title  Priority Date  Filing Date 

US11/623,883 Active US7453457B2 (en)  20000509  20070117  Computer graphics using coarse level meshes 
US12/271,963 Abandoned US20090146998A1 (en)  20000509  20081117  Computer graphics using coarse level meshes 
Country Status (4)
Country  Link 

US (3)  US7184039B2 (en) 
EP (1)  EP1292920A2 (en) 
AU (1)  AU6417501A (en) 
WO (1)  WO2002023486A2 (en) 
Cited By (2)
Publication number  Priority date  Publication date  Assignee  Title 

US20070176930A1 (en) *  20000509  20070802  Silviu Borac  Computer graphics using coarse level meshes 
US20090002376A1 (en) *  20070629  20090101  Microsoft Corporation  Gradient Domain Editing of Animated Meshes 
Families Citing this family (2)
Publication number  Priority date  Publication date  Assignee  Title 

JP4468409B2 (en) *  20070611  20100526  株式会社日立製作所  Analysis mesh generation apparatus 
US9520001B2 (en) *  20140121  20161213  Adobe Systems Incorporated  3D model enhancement 
Citations (4)
Publication number  Priority date  Publication date  Assignee  Title 

US5506947A (en) *  19940922  19960409  International Business Machines Corporation  Curve and surface smoothing without shrinkage 
EP0784295A2 (en)  19960111  19970716  Microsoft Corporation  Mesh simplification and construction of meshes 
US6009435A (en) *  19971121  19991228  International Business Machines Corporation  Progressive compression of clustered multiresolution polygonal models 
US6266062B1 (en) *  19971008  20010724  MariaCecilia Rivara  Longestedge refinement and derefinement system and method for automatic mesh generation 
Family Cites Families (1)
Publication number  Priority date  Publication date  Assignee  Title 

EP1292920A2 (en) *  20000509  20030319  Mental Images GmbH & Co. KG.  Generating coarselevel meshes from finelevel meshes 

2001
 20010509 EP EP01938501A patent/EP1292920A2/en not_active Withdrawn
 20010509 US US09/852,906 patent/US7184039B2/en active Active
 20010509 WO PCT/IB2001/001089 patent/WO2002023486A2/en active Application Filing
 20010509 AU AU6417501A patent/AU6417501A/en active Pending

2007
 20070117 US US11/623,883 patent/US7453457B2/en active Active

2008
 20081117 US US12/271,963 patent/US20090146998A1/en not_active Abandoned
Patent Citations (4)
Publication number  Priority date  Publication date  Assignee  Title 

US5506947A (en) *  19940922  19960409  International Business Machines Corporation  Curve and surface smoothing without shrinkage 
EP0784295A2 (en)  19960111  19970716  Microsoft Corporation  Mesh simplification and construction of meshes 
US6266062B1 (en) *  19971008  20010724  MariaCecilia Rivara  Longestedge refinement and derefinement system and method for automatic mesh generation 
US6009435A (en) *  19971121  19991228  International Business Machines Corporation  Progressive compression of clustered multiresolution polygonal models 
NonPatent Citations (8)
Title 

D. Zorin et al., "Interactive MultiResolution Mesh Editing" Computer Graphics Proceedings, Siggraph 97, Los Angeles, CA, Aug. 38, 1997, pp. 259268. 
Denis Zorin, Peter Schröder, Wim Sweldens, "Interactive Multiresolution Mesh Editing," Aug. 1997, Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques, p. 259268. * 
G. Taubin, "A Signal Processing Approach To Fair Surface Design" Computer Graphics Proceedings, Siggraph, Los Angeles, CA, Aug. 6, 1997, pp. 351358. 
J. Popovic, et al, "Progressive Simplicial Complexes" Computer Graphics Proceedings, Siggraph 97, Los Angeles, CA, Aug. 38, 1997, pp. 217224. 
M. Garland et al, "Simplifying surfaces with color and texture using quadric error metrics" Visualization 98. Proceedings Research Triangle Park, NC, U. S. A. Oct. 1923, 1998. 
M. Garland et al, "Surface simplification using quadric error metrics" Computer Graphics Proceedings, Siggraph 97, Proc. 24th Int'l Conf on Computer Graphics and Interactive Techniques, Los Angeles, CA, Aug. 38, 1997, pp. 209216. 
Michael Loundsbery, Tony D. DeRose, and Joe Warren "Multiresolution Analysis for Surfaces of Arbitrary Topological Type," Jan. 1997, ACM Transactions on Graphics, vol. 16, No. 1, p. 3473. * 
W. J. Schroder et al., "Decimation Of Triangle Meshes" Computer Graphics, vol. 26, No. 2, pp. 6570 (Jul. 1, 1992). 
Cited By (4)
Publication number  Priority date  Publication date  Assignee  Title 

US20070176930A1 (en) *  20000509  20070802  Silviu Borac  Computer graphics using coarse level meshes 
US7453457B2 (en) *  20000509  20081118  Mental Images Gmbh  Computer graphics using coarse level meshes 
US20090002376A1 (en) *  20070629  20090101  Microsoft Corporation  Gradient Domain Editing of Animated Meshes 
US7843456B2 (en) *  20070629  20101130  Microsoft Corporation  Gradient domain editing of animated meshes 
Also Published As
Publication number  Publication date 

US20070176930A1 (en)  20070802 
US20090146998A1 (en)  20090611 
EP1292920A2 (en)  20030319 
US20050276518A1 (en)  20051215 
AU6417501A (en)  20020326 
WO2002023486A3 (en)  20020627 
WO2002023486A2 (en)  20020321 
US7453457B2 (en)  20081118 
Similar Documents
Publication  Publication Date  Title 

Zhang et al.  Single‐view modelling of free‐form scenes  
Klein et al.  Mesh reduction with error control  
Pudney  Distanceordered homotopic thinning: a skeletonization algorithm for 3D digital images  
De Berg et al.  On levels of detail in terrains  
Feibush et al.  Synthetic texturing using digital filters  
Bischoff et al.  Automatic restoration of polygon models  
Alliez et al.  Interactive geometry remeshing  
Esedoglu et al.  Digital inpainting based on the Mumford–Shah–Euler image model  
US7551181B2 (en)  Image region filling by exemplarbased inpainting  
US7009623B2 (en)  Image processing apparatus and method, recording medium, and program thereof  
CN101203861B (en)  Large mesh deformation using the volumetric graph laplacian  
US6504569B1 (en)  2D extended image generation from 3D data extracted from a video sequence  
Lee et al.  Mesh saliency  
EP1640915B1 (en)  Method and system for providing a volumetric representation of a 3dimensional object  
US6996505B1 (en)  Methods, apparatus and computer program products for automatically generating nurbs models of triangulated surfaces using homeomorphisms  
Jones et al.  A new approach to the construction of surfaces from contour data  
US7034823B2 (en)  3D computer graphics processing apparatus and method  
Garland et al.  Fast polygonal approximation of terrains and height fields  
US6208355B1 (en)  Sketchbased editing of curves  
EP0841636B1 (en)  Method and apparatus of inputting and outputting color pictures and continuallychanging tone pictures  
US5809179A (en)  Producing a rendered image version of an original image using an image structure map representation of the image  
DE69725480T2 (en)  Mesh simplification and construction of grids  
US6208347B1 (en)  System and method for computer modeling of 3D objects and 2D images by mesh constructions that incorporate nonspatial data such as color or texture  
Westover  Footprint evaluation for volume rendering  
Erikson  Polygonal simplification: An overview 
Legal Events
Date  Code  Title  Description 

AS  Assignment 
Owner name: MENTAL IMAGES GMBH, GERMANY Free format text: MERGER;ASSIGNOR:MENTAL IMAGES G.M.B.H. & CO. KG;REEL/FRAME:017251/0320 Effective date: 20031001 

STCF  Information on status: patent grant 
Free format text: PATENTED CASE 

AS  Assignment 
Owner name: MENTAL IMAGES G.M.B.H. & CO. KG, GERMANY Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BORAC, SILVIU;REEL/FRAME:020261/0723 Effective date: 20000503 

AS  Assignment 
Owner name: MENTAL IMAGES GMBH, GERMANY Free format text: MERGER;ASSIGNOR:MENTAL IMAGES G.M.B.H. & CO. KG;REEL/FRAME:020279/0902 Effective date: 20060119 

FPAY  Fee payment 
Year of fee payment: 4 

FPAY  Fee payment 
Year of fee payment: 8 

MAFP  Maintenance fee payment 
Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553) Year of fee payment: 12 