Morphing planar graphs

C. Erten, S. G. Kobourov, C. Pitta

Research output: Contribution to conferencePaper

6 Scopus citations

Abstract

An efficient algorithm and implementation for morphing planar graphs is discussed. The five steps in the algorithm are: introduction of bend vertices, introduction of convex bounding box, compatible triangulations, affine transformation morphs, and barycentric-representation morph. The algorithm is implemented in the JAVA programming language. The main objective is to find a morph that does not introduce crossings in the intermediate drawing througout the transformation.

Original languageEnglish (US)
Pages451-452
Number of pages2
StatePublished - Sep 29 2004
EventProceedings of the Twentieth Annual Symposium on Computational Geometry (SCG'04) - Brooklyn, NY, United States
Duration: Jun 9 2004Jun 11 2004

Other

OtherProceedings of the Twentieth Annual Symposium on Computational Geometry (SCG'04)
CountryUnited States
CityBrooklyn, NY
Period6/9/046/11/04

Keywords

  • Graph drawing
  • Morphing
  • Planar graphs

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Morphing planar graphs'. Together they form a unique fingerprint.

  • Cite this

    Erten, C., Kobourov, S. G., & Pitta, C. (2004). Morphing planar graphs. 451-452. Paper presented at Proceedings of the Twentieth Annual Symposium on Computational Geometry (SCG'04), Brooklyn, NY, United States.