Morphing stick figures using optimized compatible triangulations

Vitaly Surazhsky, Craig Gotsman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations

Abstract

A "stick figure" is a connected straight-line plane graph, sometimes called a "skeleton ". Compatible stick figures are those with the same topological structure. We present a method for naturally morphing between two compatible stick figures in a manner that preserves compatibility throughout the morph. In particular, this guarantees that the intermediate shapes are also stick figures (e.g. they do not self-intersect). Our method generalizes existing algorithms for morphing compatible planar polygons using Steiner vertices, and improves the complexity of those algorithms by reducing the number of Steiner vertices used.

Original languageEnglish (US)
Title of host publicationProceedings - 9th Pacific Conference on Computer Graphics and Applications, Pacific Graphics 2001
PublisherIEEE Computer Society
Pages40-49
Number of pages10
ISBN (Electronic)0769512275
DOIs
StatePublished - 2001
Externally publishedYes
Event9th Pacific Conference on Computer Graphics and Applications, Pacific Graphics 2001 - Tokyo, Japan
Duration: Oct 16 2001Oct 18 2001

Publication series

NameProceedings - Pacific Conference on Computer Graphics and Applications
Volume2001-January
ISSN (Print)1550-4085

Other

Other9th Pacific Conference on Computer Graphics and Applications, Pacific Graphics 2001
CountryJapan
CityTokyo
Period10/16/0110/18/01

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Graphics and Computer-Aided Design
  • Modeling and Simulation

Fingerprint Dive into the research topics of 'Morphing stick figures using optimized compatible triangulations'. Together they form a unique fingerprint.

Cite this