| dc.contributor.author |
Shekhawat, Krishnendra |
|
| dc.date.accessioned |
2023-08-10T10:20:54Z |
|
| dc.date.available |
2023-08-10T10:20:54Z |
|
| dc.date.issued |
2021 |
|
| dc.identifier.uri |
https://arxiv.org/pdf/2101.06912 |
|
| dc.identifier.uri |
http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11296 |
|
| dc.description.abstract |
A plane graph is called a rectangular graph if each of its edges can be oriented
either horizontally or vertically, each of its interior regions is a four-sided
region and all interior regions can be tted in a rectangular enclosure. If
the dual of a plane graph is a rectangular graph, then the plane graph is
a rectangularly dualizable graph. A rectangular dual is area-universal if any
assignment of areas to each of its regions can be realized by a combinatorially
weak equivalent rectangular dual. It is still unknown that there exists no
polynomial time algorithm to construct an area-universal rectangular dual
for a rectangularly dualizable graph . In this paper, we describe a class of
rectangularly dualizable graphs wherein each graph can be realized by an areauniversal
rectangular dual. We also present a polynomial time algorithm for
its construction. |
en_US |
| dc.language.iso |
en |
en_US |
| dc.publisher |
ARXIV |
en_US |
| dc.subject |
Mathematics |
en_US |
| dc.subject |
Area-universality |
en_US |
| dc.subject |
Cartogram |
en_US |
| dc.subject |
Rectangularly dualizable graphs |
en_US |
| dc.subject |
Rectangular duals |
en_US |
| dc.subject |
VLSI circuit |
en_US |
| dc.title |
Rectangularly Dualizable Graphs: Area-Universality |
en_US |
| dc.type |
Article |
en_US |