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

State | Published - Sep 29 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 |

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