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/

Zendy Plus

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

Zendy Tools

Zendy Open

We continue the study of the area requirement of convex straight-line griddrawings of 3-connected plane graphs, which has been intensively investigatedin the last decades. Motivated by applications, such as graph editors, weadditionally require the obtained drawings to have bounded edge-vertexresolution, that is, the closest distance between a vertex and any non-incidentedge is lower bounded by a constant that does not depend on the size of thegraph. We present a drawing algorithm that takes as input a 3-connected planegraph with n vertices and f internal faces and computes a convex straight-linedrawing with edge-vertex resolution at least 1/2 on an integer grid of size(n-2+a)x(n-2+a), where a=min{n-3,f}. Our result improves the previouslybest-known area bound of (3n-7)x(3n-7)/2 by Chrobak, Goodrich and Tamassia.

Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution