Overview   Tree   Index 
NPR Literature
PREV  NEXT FRAMES  NO FRAME 

[Kor02]  Computer Aided Inbetweening

Kort:2002:CAI (In proceedings)
Author(s)Kort A.
Title« Computer Aided Inbetweening »
InProceedings of the Second International Symposium on Non-Photorealistic Animation and Rendering (NPAR 2002, Annecy, France, June 3--5, 2002)
Editor(s)Adam Finkelstein
Page(s)125--132
Year2002
PublisherACM Press
AddressNew York
Editor(s)Adam Finkelstein

Abstract
The production of inbetweens is a tedious task for animators and a complicated one for algorithms. In this paper, an algorithm for computer aided inbetweening and its integration in a pen-based graphical user interface are presented.The algorithm is layer-based, assuming an invariant layering order. It is applicable to animations in a style similar to paper cut out, in which the drawings on the cut-out pieces are inbetweened as well. The content of each key drawing is analysed and classified into strokes, chains of strokes and relations that hold among them. Rules decide what parts of different drawings may be matched. These rules specify allowed changes between relations in key drawings. A cost function based approach determines the correct matching of strokes. Generated animation paths between corresponding strokes determine the resulting inbetweens.To hold for possible mismatchings and to allow for artistic control over the results, the inbetweening algorithm is embedded in a free form graphic user interface. Thus artists are enabled to focus on the part of the inbetweening task computers are not able to solve.

BibTeX code
@inproceedings{Kort:2002:CAI,
  optnote = {},
  optorganization = {},
  author = {Alexander Kort},
  optkey = {},
  optannote = {},
  optseries = {},
  editor = {Adam Finkelstein},
  address = {New York},
  localfile = {papers/Kort.2002.CAI.pdf},
  publisher = {ACM Press},
  doi = {http://doi.acm.org/10.1145/508530.508552},
  optmonth = {},
  opturl = {},
  optcrossref = {},
  booktitle = NPAR2002,
  optstatus = {url},
  optvolume = {},
  optnumber = {},
  title = {{C}omputer {A}ided {I}nbetweening},
  abstract = {The production of inbetweens is a tedious task for animators and a
              complicated one for algorithms. In this paper, an algorithm for
              computer aided inbetweening and its integration in a pen-based
              graphical user interface are presented.The algorithm is
              layer-based, assuming an invariant layering order. It is
              applicable to animations in a style similar to paper cut out, in
              which the drawings on the cut-out pieces are inbetweened as well.
              The content of each key drawing is analysed and classified into
              strokes, chains of strokes and relations that hold among them.
              Rules decide what parts of different drawings may be matched.
              These rules specify allowed changes between relations in key
              drawings. A cost function based approach determines the correct
              matching of strokes. Generated animation paths between
              corresponding strokes determine the resulting inbetweens.To hold
              for possible mismatchings and to allow for artistic control over
              the results, the inbetweening algorithm is embedded in a free form
              graphic user interface. Thus artists are enabled to focus on the
              part of the inbetweening task computers are not able to solve. },
  year = {2002},
  pages = {125--132},
}

 Overview   Tree   Index 
NPR Literature
PREV  NEXT FRAMES  NO FRAME 

Submit a bug

This document was generated by bib2html 3.3.
Copyright © 1998-05 Stéphane GALLAND (under the GNU General Public License)

Valid HTML 4.01!Valid CSS!