Select one of the links below.

Available tesselations and visualizations

triangulation G₇₁₀	rings	construction	dual	FIT	the finest regular triangulation
triangulation G₇₁₁	rings	construction	dual	FIT	used in examples in the paper
triangulation G₇₂₁	rings	construction	dual	FIT	demonstrates the Goldberg-Coxeter construction
triangulation G₈₁₀	rings	construction	dual	FIT	coarser than G₇₁₀
binary tiling	rings	construction	dual	FIT	a bit different version than in the paper
square grid {4,5}	rings	construction	dual	FIT	an example of a square grid
GC_2,1 {4,5}	rings	construction	dual	FIT	Goldberg-Coxeter operation on a square grid
triangulation G₆₁₀	rings	construction	dual		Euclidean triangulation
face configuration V8.8.5	rings	construction	dual		an example of a triangulation where our distance algorithm does not work
face configuration V14.14.3	rings	-	dual		an example of a triangulation where regular generation does not work
triangulation G₇₁₁	rings	construction	dual		horocycles instead of circles

Instructions

rings: white edges are rings, green edges are non-rightmost child edges, red edges are rightmost child edges. On square grids, grey edges are used for rings (because they are not connected). Blue lines show the Goldberg-Coxeter construction.
construction: this shows the assignment of types to vertices, and lists the number of k-th level descendants of the current vertex in the center, for each k.
dual: this shows the dual tesselation.
FIT: this is the visualization of HRG/DHRG, on a very small network (FIT coauthorship). Initially, the embedding found by the BFKL embedder is shown. Press '/' to move each node to the nearest grid point. For each distance, the total number of pairs of nodes in this distance, and the number of edges of that length, is shown. You can then drag nodes to other positions to see the effect, pick which loglikelihood to compute (based on logistic function / "optimal" i.e. actual frequency of edges for each distance / "monotonic" i.e. like "optimal" but enforce the edge probability to be decreasing). You can also drag nodes to other positions or run iterations of the local search.