Can an NN model plainly learn planar layouts?

09/02/2022
by   Smon van Wageningen, et al.
0

Planar graph drawings tend to be aesthetically pleasing. In this poster we explore a Neural Network's capability of learning various planar graph classes. Additionally, we also investigate the effectiveness of the model in generalizing beyond planarity. We find that the model can outperform conventional techniques for certain graph classes. The model, however, appears to be more susceptible to randomness in the data, and seems to be less robust than expected.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/18/2018

Planar CPG graphs

We show that for any k ≥ 0, there exists a planar graph which is B_k+1-C...
research
08/31/2018

Upward Planar Morphs

We prove that, given two topologically-equivalent upward planar straight...
research
12/03/2018

Planar Ramsey graphs

We say that a graph H is planar unavoidable if there is a planar graph G...
research
11/14/2016

A DNN Framework For Text Image Rectification From Planar Transformations

In this paper, a novel neural network architecture is proposed attemptin...
research
04/30/2013

An Improvised Algorithm to Identify The Beauty of A Planar Curve

An improvised algorithm is proposed based on the work of Yoshimoto and H...
research
05/01/2021

Asymptotic behavior of fronts and pulses of the bidomain model

The bidomain model is the standard model for cardiac electrophysiology. ...
research
02/26/2018

Multiscale Planar Graph Generation

The study of network representations of physical, biological, and social...

Please sign up or login with your details

Forgot password? Click here to reset