Morphing planar graphs

C. Erten, Stephen G Kobourov, C. Pitta

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

6 Citations (Scopus)

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)
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
Pages451-452
Number of pages2
StatePublished - 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

Fingerprint

Morphing
Planar graph
Centrobaric
Efficient Implementation
Triangulation
Affine transformation
Programming Languages
Efficient Algorithms
Computer programming languages
Drawing

Keywords

  • Graph drawing
  • Morphing
  • Planar graphs

ASJC Scopus subject areas

  • Software
  • Geometry and Topology
  • Safety, Risk, Reliability and Quality
  • Chemical Health and Safety

Cite this

Erten, C., Kobourov, S. G., & Pitta, C. (2004). Morphing planar graphs. In Proceedings of the Annual Symposium on Computational Geometry (pp. 451-452)

Morphing planar graphs. / Erten, C.; Kobourov, Stephen G; Pitta, C.

Proceedings of the Annual Symposium on Computational Geometry. 2004. p. 451-452.

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

Erten, C, Kobourov, SG & Pitta, C 2004, Morphing planar graphs. in Proceedings of the Annual Symposium on Computational Geometry. pp. 451-452, Proceedings of the Twentieth Annual Symposium on Computational Geometry (SCG'04), Brooklyn, NY, United States, 6/9/04.
Erten C, Kobourov SG, Pitta C. Morphing planar graphs. In Proceedings of the Annual Symposium on Computational Geometry. 2004. p. 451-452
Erten, C. ; Kobourov, Stephen G ; Pitta, C. / Morphing planar graphs. Proceedings of the Annual Symposium on Computational Geometry. 2004. pp. 451-452
@inproceedings{e5f19fc6c35440cd918c2d1a83feb217,
title = "Morphing planar graphs",
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.",
keywords = "Graph drawing, Morphing, Planar graphs",
author = "C. Erten and Kobourov, {Stephen G} and C. Pitta",
year = "2004",
language = "English (US)",
pages = "451--452",
booktitle = "Proceedings of the Annual Symposium on Computational Geometry",

}

TY - GEN

T1 - Morphing planar graphs

AU - Erten, C.

AU - Kobourov, Stephen G

AU - Pitta, C.

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

KW - Graph drawing

KW - Morphing

KW - Planar graphs

UR - http://www.scopus.com/inward/record.url?scp=4544299195&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4544299195&partnerID=8YFLogxK

M3 - Conference contribution

SP - 451

EP - 452

BT - Proceedings of the Annual Symposium on Computational Geometry

ER -