### 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) |
---|---|

Title of host publication | Proceedings of the Annual Symposium on Computational Geometry |

Pages | 451-452 |

Number of pages | 2 |

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 | United States |

City | Brooklyn, NY |

Period | 6/9/04 → 6/11/04 |

### Fingerprint

### 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

*Proceedings of the Annual Symposium on Computational Geometry*(pp. 451-452)

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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

}

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 -