Growing fat graphs

Alon Efrat, Stephen G Kobourov, M. Stepp, C. Wenk

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

8 Scopus citations

Abstract

An algorithm for growing fat graphs with edges of variable thickness was presented. A restricted class of graphs, occurring in VLSI wire routing, was empolyed for demonstration. The general technique for finding the continuous homotopic of maximum separation was also discussed. A video, showing examples of graph growth illustrating merge, split and stopping events and the formation and breaking of bundles, was presented.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
Pages277-278
Number of pages2
Publication statusPublished - 2002
EventProceedings of the 18th Annual Symposium on Computational Geometry (SCG'02) - Barcelona, Spain
Duration: Jun 5 2002Jun 7 2002

Other

OtherProceedings of the 18th Annual Symposium on Computational Geometry (SCG'02)
CountrySpain
CityBarcelona
Period6/5/026/7/02

    Fingerprint

ASJC Scopus subject areas

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

Cite this

Efrat, A., Kobourov, S. G., Stepp, M., & Wenk, C. (2002). Growing fat graphs. In Proceedings of the Annual Symposium on Computational Geometry (pp. 277-278)