Optimizing regular edge labelings

K. Buchin, B. Speckmann, S. Verdonschot

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

5 Citaten (Scopus)

Samenvatting

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.
Originele taal-2Engels
TitelGraph Drawing (18th International Symposium, GD'10, Konstanz, Germany, September 21-24, 2010. Revised selected papers)
RedacteurenU. Brandes, S. Cornelson
Plaats van productieBerlin
UitgeverijSpringer
Pagina's117-128
ISBN van geprinte versie978-3-642-18468-0
DOI's
StatusGepubliceerd - 2011

Publicatie series

NaamLecture Notes in Computer Science
Volume6502
ISSN van geprinte versie0302-9743

Vingerafdruk Duik in de onderzoeksthema's van 'Optimizing regular edge labelings'. Samen vormen ze een unieke vingerafdruk.

Citeer dit