ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Computers & Graphics
Volume 25, Issue 1, February 2001, Pages 29-39
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (694 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0097-8493(00)00105-9    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2001 Elsevier Science B.V. All rights reserved.

Shape Blending

Blending polygonal shapes with different topologies*1

Tatiana Surazhsky1, E-mail The Corresponding Author, , a, Vitaly Surazhsky2, E-mail The Corresponding Author, , b, Gill Barequet3, E-mail The Corresponding Author, , b and Ayellet Tal4, Corresponding Author Contact Information, E-mail The Corresponding Author, , c

a Department of Applied Mathematics, The Technion-IIT, Haifa 32000, Israel b Department of Computer Science, The Technion-IIT, Haifa 32000, Israel c Department of Electrical Engineering, The Technion-IIT, Haifa 32000, Israel

Available online 9 February 2001.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

In this paper, we propose a new method for morphing between two polygonal, possibly non-simply connected, shapes in the plane. The method is based on reconstructing an xy-monotone surface whose extreme cross-sections coincide with the given shapes. The surface generated by our algorithm does not contain any self-intersections, does not change the topologies of the input slices, does not contain any horizontal triangles, and guarantees that all the topology changes occur at a mid-height which is a degenerate form of both input topologies. All these properties are highly desirable for blending shapes of different topologies.

Author Keywords: Metamorphosis; Morphing; Interpolation; Blending; Reconstruction

Article Outline

1. Introduction
2. Background
2.1. The reconstruction problem
2.2. A brief overview of the reconstruction algorithm
3. Statement of the problem
4. The algorithm
4.1. Triangle subdivision
4.2. Assigning z-coordinates
4.3. Complexity analysis
5. Properties of the algorithm
6. Experimental results
7. Conclusion
References












Computers & Graphics
Volume 25, Issue 1, February 2001, Pages 29-39
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.