Picture theory: algorithms and software

This thesis is concerned with developing and implementing algorithms based upon the geometry of pictures. Spherical pictures have been used in many areas of combinatorial group theory, and particularly, they have shown to be a useful method when studying the second homotopy module, 1T2, of a presentation ([3],[4],[7],[12],[41] and [64]). Computational programs that implement picture theoretical and design algorithms could advance the areas in which picture theory can be used, due to the much faster time taken to derive results than that of manual calculations. A variety of algorithms are presented. A data structure has been devised to represent spherical pictures. A method is given that verifies that a given data structure represents a picture, or set of pictures, over a group presentation. This method includes a new planarity testing algorithm, which can be performed on any graph. A computational algorithm has been implemented that determines if a given presentation defines a group extension. This work is based upon the algorithm of Baik et al. [1] which has been developed using the theory of pictures. A 3-presentation for a group G is given by , where P is a presentation for G and s is a set of generators for 1T2. The set s can be described in a number of ways. An algorithm is given that produces a generating set of spherical pictures for 1T2 when s is given in the form of identity sequences. Conversely, if s is given in terms of spherical pictures, then the corresponding identity sequences that describe 1T2 can be determined. The above algorithms are contained in the Spherical PIcture Editor (SPICE). SPICE is a software package that enables a user to manually draw pictures over group presentations and, for these pictures, call the algorithms described above. It also contains a library of generating pictures for the non abelian groups of order at most 30. Furthermore, a method has been implemented that automatically draws a spherical picture from a corresponding identity sequence. Again, this new graph drawing technique can be performed on any arbitrary graph

From singularities to graphs

In this paper I analyze the problems which led to the introduction of graphs as tools for studying surface singularities. I explain how such graphs were initially only described using words, but that several questions made it necessary to draw them, leading to the elaboration of a special calculus with graphs. This is a non-technical paper intended to be readable both by mathematicians and philosophers or historians of mathematics.Comment: 23 pages, 27 figures. Expanded version of the talk given at the conference "Quand la forme devient substance : puissance des gestes, intuition diagrammatique et ph\'enom\'enologie de l'espace", which took place at Lyc\'ee Henri IV in Paris from 25 to 27 January 201

Fast Spherical Drawing of Triangulations: An Experimental Study of Graph Drawing Tools

We consider the problem of computing a spherical crossing-free geodesic drawing of a planar graph: this problem, as well as the closely related spherical parameterization problem, has attracted a lot of attention in the last two decades both in theory and in practice, motivated by a number of applications ranging from texture mapping to mesh remeshing and morphing. Our main concern is to design and implement a linear time algorithm for the computation of spherical drawings provided with theoretical guarantees. While not being aesthetically pleasing, our method is extremely fast and can be used as initial placer for spherical iterative methods and spring embedders. We provide experimental comparison with initial placers based on planar Tutte parameterization. Finally we explore the use of spherical drawings as initial layouts for (Euclidean) spring embedders: experimental evidence shows that this greatly helps to untangle the layout and to reach better local minima

Periodic planar straight-frame drawings with polynomial resolution

International audienceWe present a new algorithm to compute periodic (planar) straight-line drawings of toroidal graphs. Our algorithm is the first to achieve two important aesthetic criteria: the drawing fits in a straight rectangular frame, and the grid area is polynomial, precisely the grid size is O(n 4 × n 4). This solves one of the main open problems in a recent paper by Duncan et al. [3]

Skein theory for the D_{2n} planar algebras

We give a combinatorial description of the ``$D_{2n}$ planar algebra,'' by generators and relations. We explain how the generator interacts with the Temperley-Lieb braiding. This shows the previously known braiding on the even part extends to a `braiding up to sign' on the entire planar algebra. We give a direct proof that our relations are consistent (using this `braiding up to sign'), give a complete description of the associated tensor category and principal graph, and show that the planar algebra is positive definite. These facts allow us to identify our combinatorial construction with the standard invariant of the subfactor $D_{2n}$.Comment: Correcting several errors noticed by careful readers