ACM Home Page
Please provide us with feedback. Feedback
As-rigid-as-possible shape interpolation
Full text PdfPdf (1.81 MB)
Source International Conference on Computer Graphics and Interactive Techniques archive
Proceedings of the 27th annual conference on Computer graphics and interactive techniques table of contents
Pages: 157 - 164  
Year of Publication: 2000
ISBN:1-58113-208-5
Authors
Marc Alexa  Darmstadt University of Technology
Daniel Cohen-Or  Tel Aviv University
David Levin  Tel Aviv University
Sponsor
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM Press/Addison-Wesley Publishing Co.  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 24,   Downloads (12 Months): 141,   Citation Count: 54
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/344779.344859
What is a DOI?

ABSTRACT

We present an object-space morphing technique that blends the interiors of given two- or three-dimensional shapes rather than their boundaries. The morph is rigid in the sense that local volumes are least-distorting as they vary from their source to target configurations. Given a boundary vertex correspondence, the source and target shapes are decomposed into isomorphic simplicial complexes. For the simplicial complexes, we find a closed-form expression allocating the paths of both boundary and interior vertices from source to target locations as a function of time. Key points are the identification of the optimal simplex morphing and the appropriate definition of an error functional whose minimization defines the paths of the vertices. Each pair of corresponding simplices defines an affine transformation, which is factored into a rotation and a stretching transformation. These local transformations are naturally interpolated over time and serve as the basis for composing a global coherent least-distorting transformation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. Alexa. Merging Polyhedral Shapes with Scattered Features. The Visual Computer, 16, 1, 2000
 
2
3
 
4
 
5
B. Chazelle. Triangulating a simple polygon in linear time. Proc/ 31st Symp. on Foundations of Computer Science (FOCS), pp. 220-230, 1990
 
6
E. Carmel, D. Cohen-Or. Warp-guided Object Space Morphing. The Visual Computer, 13, 1997
 
7
S. Cohen, G. Elber, R. Bar Yehuda. Matching of freeform curves. CAD, 19, 5, pp. 369-378, 1997
8
 
9
 
10
 
11
L.A. Freitag, M.T. Jones, and P.E. Plassmann. An efficient parallel algorithm for mesh smoothing. 4th Int. Meshing Roundtable, pp. 47-58, 1995
 
12
G.H. Golub and C.F. van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, 1983
 
13
E. Goldstein and C. Gotsman. Polygon Morphing using a Multiresolution Representation. Graphics Interface '95, pp. 247- 254, 1995
 
14
 
15
16
 
17
B. Joe. Geompack. ftp://ftp.cs.ualberta.ca/pub/geompack
 
18
19
 
20
21
22
23
 
24
T.W. Sederberg, P. Gao, G. Wang, and H. Mu. 2-D shape blending: An intrinsic solution to the vertex-path problem. Computer Graphics, 27, pp. 15-18, 1993
 
25
 
26
A. Shapiro and A. Tal. Polyhedron realization for shape transformation. The Visual Computer, 14, 8/9, 1998
 
27
 
28
A. Tal and G. Elber. Image Morphing with Feature Preserving Texture. Computer Graphics Forum (Eurographics '99 Proceedings), 18, 3, pp. 339-348, 1999
 
29
G. Wolberg. Digital Image Morphing. IEEE Computer Society Press, 1990
 
30
G. Wolberg. Image Morphing Survey. The Visual Computer, 14, 8/9, 1998
 
31

CITED BY  54

Collaborative Colleagues:
Marc Alexa: colleagues
Daniel Cohen-Or: colleagues
David Levin: colleagues