Optimizing regular edge labelings

K. Buchin, B. Speckmann, S. Verdonschot

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

5 Citations (Scopus)
4 Downloads (Pure)


A regular edge labeling (REL) of an irreducible triangulation G uniquely defines a rectangular dual of G. Rectangular duals find applications in various areas: as floor plans of electronic chips, in architectural designs, as rectangular cartograms, or as treemaps. An irreducible triangulation can have many RELs and hence many rectangular duals. Depending on the specific application different duals might be desirable. In this paper we consider optimization problems on RELs and show how to find optimal or near-optimal RELs for various quality criteria. Furthermore, we give upper and lower bounds on the number of RELs.
Original languageEnglish
Title of host publicationGraph Drawing (18th International Symposium, GD'10, Konstanz, Germany, September 21-24, 2010. Revised selected papers)
EditorsU. Brandes, S. Cornelson
Place of PublicationBerlin
ISBN (Print)978-3-642-18468-0
Publication statusPublished - 2011

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Dive into the research topics of 'Optimizing regular edge labelings'. Together they form a unique fingerprint.

Cite this