Abstract
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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Buchin, K., Speckmann, B., & Verdonschot, S. (2011). Optimizing regular edge labelings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6502 LNCS, pp. 117–128). https://doi.org/10.1007/978-3-642-18469-7_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
