Optimizing Regular Edge Labelings

Buchin, Kevin and Speckmann, Bettina and Verdonschot, Sander (2011) Optimizing Regular Edge Labelings. In: Graph Drawing 18th International Symposium, GD 2010, September 21-24, 2010 , pp. 117-128(Official URL: http://dx.doi.org/10.1007/978-3-642-18469-7_11).

Full text not available from this repository.


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.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-18469-7_11
Classifications: G Algorithms and Complexity > G.999 Others
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1199

Actions (login required)

View Item View Item