Merging polyhedral shapes with scattered features

Visual Computer

Volumn 16, Issue 1, 2000, Pages 26-37

  Alexa, Marc ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ANIMATION; COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; FEATURE EXTRACTION;

IMAGE MORPHING; POLYHEDRAL; SCATTERED FEATURE;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 0033727006     PISSN: 01782789     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00007211     Document Type: Article

References (26)

1. Alexa M (1999) Merging polyhedral shapes with scattered features. Proceedings of Shape Modelling International'99, IEEE Computer Society Press, Los Alamitos, CA, pp 202-210
2. de Berg M, van Kreveld M, Overmars M, Schwarzkopf O (1997) Computational geometry: algorithms and applications. Springer, Heidelberg
3. Carmel E, Cohen-Or D (1998) Warp-guided object-space morphing. Visual Comput 13:465-478
4. Cohen-Or D, Levin D, Solomovici A (1998) Three-dimensional distance field metamorphosis. ACM Trans Graph 17:116-141
5. DeCarlo D, Gallier J (1996) Topological evolution of surfaces. Proceedings of Graphics Interface '96, Canadian Human-Computer Communications Society, Toronto, Canada, pp 194-203
6. Eck M, DeRose T, Duchamp T, Hoppe H, Lounsberry M, Stuetzle W (1995) Multiresolution analysis of arbitrary meshes. (SIGGRAPH '95) Comput Graph 29:173-182
7. Edelsbrunner H, Mücke EP (1990) Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans Graph 9:66-104
8. Fary I (1948) On straight lines representation of planar graphs. Acta Sci Math Szeged 11:229-233
9. Finke U, Hinrichs K (1995) Overlaying simply connected planar subdivisions in linear time. Proceedings of the 11th Annual ACM Symposium on Computational Geometry, pp 119-126
10. Gregory A, State A, Lin MC, Manocha D, Livingston MA (1998) Feature-based surface decomposition for correspondence and morphing between polyhedra. Proceedings of Computer Animation '98, Philadelphia
11. Harary F (1969) Graph theory, Addison-Wesley, Reading, Mass
12. Kanai T, Suzuki H, Kimura F (1997) 3D Geometric metamorphosis based on harmonic map. Visual Comput 14:166-176
13. Kent JR, Parent RE, Carlson WE (1991) Establishing correspondences by topological merging: a new approach to 3-D shape transformation. Proceedings of Graphics Interface '91, Calgary, Canadian Information Processing Society, pp 271-278
14. Kent JR, Carlson WE, Parent RE (1992) Shape transformation for polyhedral objects. (SIGGRAPH '92) Comput Graph 26:47-54
15. Lazarus F, Verroust A (1994) Feature-based shape transformation for polyhedral objects. Proceedings of the 5th Eurgraphics Workshop on Animation and Simulation, Oslo, Eurographics Association, pp 1-14
16. Lazarus F, Verroust A (1998) Three-dimensional metamorphosis: a survey. Visual Comput 14:373-389
17. Lerios A. Garfinkle CD, Levoy M (1995) Feature-based volume metamorphosis. (SIGGRAPH '95) Comput Graph 29:449-456
18. Muller DE, Preparata FP (1978) Finding the intersections of two convex polyhedra. Theor Comput Sci 7:212-236
19. Ruprecht D. Müller H (1995) Image warping with scattered data interpolation. IEEE Comput Graph Appl 15:37-44
20. Shapiro A, Tal A (1998) Polyhedron realization for shape transformation. Visual Comput 14:429-444
21. Stein SK (1951) Convex maps Proc Am Math Soc 2:464-466
22. Steinitz E, Rademacher H (1934) Vorlesung über die Theorie der Polyeder. Springer, Berlin
23. Tutte WT (1963) How to draw a graph. Proc London Math Soc 3:743-768
24. Wagner K (1936) Bemerkungen zum Vierfarbenproblem. Jber Deutsch Math-Verein 46:26-32
25. Wolberg G (1990) Digital image warping. IEEE Computer Society Press, Los Alamitos
26. Wolberg G (1998) Image morphing: a survey. Visual Comput 14:360-372