Related papers: Drawing Diestel-Leader graphs in 3D
This is a userguide for the LaTex package Tikz-FeynHand at https://ctan.org/pkg/tikz-feynhand which let's you draw Feynman diagrams using TikZ. It contains many examples and a 5-minute introduction to TikZ. The package is a low-end…
TikZ-Feynman is a LaTeX package allowing Feynman diagrams to be easily generated within LaTeX with minimal user instructions and without the need of external programs. It builds upon the TikZ package and leverages the graph placement…
Using probabilistic methods, we obtain grid-drawings of graphs without crossings with low volume and small aspect ratio. We show that every $D$-degenerate graph on $n$ vertices can be drawn in $[m]^3$ where $m^3 = O(D^2 n\log n)$. In…
Divisible design digraphs which can be obtained as Cayley digraphs are studied. A characterization of divisible design Cayley digraphs in terms of the generating sets is given. Further, we give several constructions of divisible design…
We describe a method for encoding path information in graphs into a 3-d tensor. We show a connection between the introduced path representation scheme and powered adjacency matrices. To alleviate the heavy computational demands of working…
We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes. We insist on straight-line edges and crossing-free drawings. This problem has many connections…
While stabilizer tableaus have proven useful as a descriptive tool for additive quantum codes, they otherwise offer little guidance for concrete constructions or algorithm analysis. We introduce a representation of stabilizer codes as…
Dynamic graphs arise in various real-world applications, and it is often welcomed to model the dynamics directly in continuous time domain for its flexibility. This paper aims to design an easy-to-use pipeline (termed as EasyDGL which is…
For a simple graph $G$, the $3$-distance graph, $D_3(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if and only if their distance is $3$ in the graph $G$. For a connected graph $G$, we provide some conditions for…
A package for drawing publication-quality Feynman diagrams written in GLE is described.
This paper introduces a model for producing stylized line drawings from 3D shapes. The model takes a 3D shape and a viewpoint as input, and outputs a drawing with textured strokes, with variations in stroke thickness, deformation, and color…
In this article we describe a program -- called planar_draw -- to draw maps on oriented surfaces in the plane. The drawings are coded as tikz files that can easily be manipulated and used in latex documents. Next to plane maps -- a case for…
The geometry of three-dimensional (3D) graphs, consisting of nodes and edges, plays a crucial role in many important applications. An excellent example is molecular graphs, whose geometry influences important properties of a molecule…
A $d$-dimensional hypercube drawing of a graph represents the vertices by distinct points in $\{0,1\}^d$, such that the line-segments representing the edges do not cross. We study lower and upper bounds on the minimum number of dimensions…
This paper reports on 3D-printed dielectric image lines for low-loss subTHz applications between 140 and 220 GHz. In contrast to conventional dielectric waveguides, a conductive copper substrate is used to achieve robust routing and…
An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We study the edge-identifying code problem, i.e. the identifying code…
This paper introduces a method for learning to generate line drawings from 3D models. Our architecture incorporates a differentiable module operating on geometric features of the 3D model, and an image-based module operating on view-based…
The demand of two-dimensional source coding and constrained coding has been getting higher these days, but compared to the one-dimensional case, many problems have remained open as the analysis is cumbersome. A main reason for that would be…
In this paper, we characterize some certain directed strongly regular Cayley graphs on Dihedral groups $D_{n}$, where $n\geqslant 3$ is a positive integer.
We show that (n,2^n) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation reduces the…