A New Tool for Rectangular Dualization

##article.authors##

  • Massimo Ancona Università degli Studi di Genova - Dipartimento di Informatica e Scienze dell'Informazione
  • Gianluca Quercini Università degli Studi di Genova - Dipartimento di Informatica e Scienze dell'Informazione
  • Paolo Pastorelli Università degli Studi di Genova - Dipartimento di Informatica e Scienze dell'Informazione

##semicolon##

https://doi.org/10.1685/

##semicolon##

Rectangular Dualization##common.commaListSeparator## Orthogonal Graph Drawing##common.commaListSeparator## Bus-Mode Drawing##common.commaListSeparator## Clustered Graphs##common.commaListSeparator## Electronic Institutions

##article.abstract##

OcORD is a software tool for rectangular dualization. Rectangular dualization is a dual representation of a plane graph introduced in the early seventies. It proved to be effective in applications such as architectural space planning and VLSI floorplanning. However, not all plane graphs admit a rectangular dual, which imposes severe limitations on its use in other applications. OcORD aims at freeing rectangular dualization from such restrictions and proving its effectiveness in graph visualization. This is achieved in two ways. Firstly, OcORD features a new linear-time algorithm creating a rectangular dual of any plane graph. Secondly, it shows how nice drawings of a graph can be easily obtained from its rectangular dual. Finally, the automatic generation of a Virtual World through rectangular dualization is described. [DOI: 10.1685/CSC09301] About DOI

##submission.authorBiographies##

  • ##submission.authorWithAffiliation##
    Full Professor at Università degli Studi di Genova - Dipartimento di Informatica e Scienze dell'Informazione
  • ##submission.authorWithAffiliation##
    PhD Student in Computer Science at Università degli Studi di Genova - Dipartimento di Informatica e Scienze dell'Informazione
  • ##submission.authorWithAffiliation##
    Master Student at Università degli Studi di Genova - Dipartimento di Informatica e Scienze dell'Informazione

##submission.downloads##

##submissions.published##

2009-08-12

##issue.issue##

##section.section##

Articles