Morphing planar graphs

C. Erten; S. G. Kobourov; C. Pitta

doi:10.1145/997817.997886

Morphing planar graphs

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

Computer Science

Research output: Contribution to conference › Paper › peer-review

7 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 language	English (US)
Pages	451-452
Number of pages	2
DOIs	https://doi.org/10.1145/997817.997886
State	Published - 2004
Event	Proceedings of the Twentieth Annual Symposium on Computational Geometry (SCG'04) - Brooklyn, NY, United States Duration: Jun 9 2004 → Jun 11 2004

Other

Other	Proceedings of the Twentieth Annual Symposium on Computational Geometry (SCG'04)
Country/Territory	United States
City	Brooklyn, NY
Period	6/9/04 → 6/11/04

Keywords

Graph drawing
Morphing
Planar graphs

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Computational Mathematics

Access to Document

10.1145/997817.997886

Cite this

@conference{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, \{S. G.\} and C. Pitta",

year = "2004",

doi = "10.1145/997817.997886",

language = "English (US)",

pages = "451--452",

note = "Proceedings of the Twentieth Annual Symposium on Computational Geometry (SCG'04) ; Conference date: 09-06-2004 Through 11-06-2004",

}

TY - CONF

T1 - Morphing planar graphs

AU - Erten, C.

AU - Kobourov, S. 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 - https://www.scopus.com/pages/publications/4544299195

UR - https://www.scopus.com/pages/publications/4544299195#tab=citedBy

U2 - 10.1145/997817.997886

DO - 10.1145/997817.997886

M3 - Paper

AN - SCOPUS:4544299195

SP - 451

EP - 452

T2 - Proceedings of the Twentieth Annual Symposium on Computational Geometry (SCG'04)

Y2 - 9 June 2004 through 11 June 2004

ER -

Morphing planar graphs

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this