English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A plus-contact representation of a planar graph $G$ is called $c$-balanced iffor every plus shape $+_v$, the number of other plus shapes incident to eacharm of $+_v$ is at most $ c \Delta +O(1)$, where $\Delta$ is the maximum degreeof $G$. Although small values of $c$ have been achieved for a few subclasses ofplanar graphs (e.g., $2$- and $3$-trees), it is unknown whether $c$-balancedrepresentations with $c<1$ exist for arbitrary planar graphs.  In this paper we compute $(1/2)$-balanced plus-contact representations forall planar graphs that admit a rectangular dual. Our result implies that anygraph with a rectangular dual has a 1-bend box-orthogonal drawings such thatfor each vertex $v$, the box representing $v$ is a square of side length$\frac{deg(v)}{2}+ O(1)$.

A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings