Overview Tree Index
NPR Literature
PREV  NEXT FRAMES  NO FRAME

[SG+92]  A Physically Based Approach to 2D Shape Blending

 Sederberg:1992:PBA (Article) Author(s) Sederberg T. and Greenwood E. Title « A Physically Based Approach to 2D Shape Blending » Journal ACM SIGGRAPH Computer Graphics, Proceedings of ACM SIGGRAPH 92 (Chicago, IL, July 26--31, 1992) Volume 26 Number 3 Page(s) 25--34 Year 1992 Editor(s) Edwin E. Catmull

 Abstract This paper presents a new algorithm for smoothly blending be- tween two 2-D polygonal shapes. The algorithm is based on a physical model wherein one of the shapes is considered to be con- structed of wire, and a solution is found whereby the first shape can be bent and/or stretched into the second shape with a min- imum amount of work. The resulting solution tends to associate regions on the two shapes which look alike. If the two poly- gons have m and n vertices respectively, the algorithm is O(mn). The algorithm avoids local shape inversions in which intermediate polygons self-intersect, if such a solution exists.

 BibTeX code @article{Sederberg:1992:PBA, number = {3}, month = jul, optaddress = {New York}, optorganization = {ACM SIGGRAPH}, author = {Thomas W. Sederberg and Eugene Greenwood}, optkey = {}, optseries = CGPACS, editor = {Edwin E. Catmull}, localfile = {papers/Sederberg.1992.PBA.pdf}, optkeywords = {animation, physically based algorithms}, doi = {http://doi.acm.org/10.1145/142920.134001}, journal = SIGGRAPH92, optconference = {held in Chicago, Illinois; 26-31 July 1992}, citeseer = {http://citeseer.nj.nec.com/sederberg92physically.html}, volume = {26}, optsubject = {{\bf I.3.5} Computing Methodologies, COMPUTER GRAPHICS, Computational Geometry and Object Modeling, Geometric algorithms, languages, and systems. {\bf I.3.7} Computing Methodologies, COMPUTER GRAPHICS, Three-Dimensional Graphics and Realism, Animation. {\bf I.3.3} Computing Methodologies, COMPUTER GRAPHICS, Picture/Image Generation. {\bf I.3.5} Computing Methodologies, COMPUTER GRAPHICS, Computational Geometry and Object Modeling, Curve, surface, solid, and object representations.}, abstract = {This paper presents a new algorithm for smoothly blending be- tween two 2-D polygonal shapes. The algorithm is based on a physical model wherein one of the shapes is considered to be con- structed of wire, and a solution is found whereby the first shape can be bent and/or stretched into the second shape with a min- imum amount of work. The resulting solution tends to associate regions on the two shapes which look alike. If the two poly- gons have m and n vertices respectively, the algorithm is O(mn). The algorithm avoids local shape inversions in which intermediate polygons self-intersect, if such a solution exists.}, title = {{A} {P}hysically {B}ased {A}pproach to 2{D} {S}hape {B}lending}, pages = {25--34}, year = {1992}, }

 Overview Tree Index
NPR Literature
PREV  NEXT FRAMES  NO FRAME

This document was generated by bib2html 3.3.