Developing a Mathematical Model for Bobbin Lace

Bobbin lace is a fibre art form in which intricate and delicate patterns are created by braiding together many threads. An overview of how bobbin lace is made is presented and illustrated with a simple, traditional bookmark design. Research on the topology of textiles and braid theory form a base for the current work and is briefly summarized. We define a new mathematical model that supports the enumeration and generation of bobbin lace patterns using an intelligent combinatorial search. Results of this new approach are presented and, by comparison to existing bobbin lace patterns, it is demonstrated that this model reveals new patterns that have never been seen before. Finally, we apply our new patterns to an original bookmark design and propose future areas for exploration.Comment: 20 pages, 18 figures, intended audience includes Artists as well as Computer Scientists and Mathematician

Trees and Matchings

In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed (and undirected) graphs, where edges carry nonnegative weights that induce a weighting on the set of spanning trees. We show that the weighted, directed spanning trees (often called arborescences) of any planar graph G can be put into a one-to-one weight-preserving correspondence with the perfect matchings of a related planar graph H. One special case of this result is a bijection between perfect matchings of the hexagonal honeycomb lattice and directed spanning trees of a triangular lattice. Another special case gives a correspondence between perfect matchings of the ``square-octagon'' lattice and directed weighted spanning trees on a directed weighted version of the cartesian lattice. In conjunction with results of Kenyon, our main theorem allows us to compute the measures of all cylinder events for random spanning trees on any (directed, weighted) planar graph. Conversely, in cases where the perfect matching model arises from a tree model, Wilson's algorithm allows us to quickly generate random samples of perfect matchings.Comment: 32 pages, 19 figures (minor revisions from version 1

Hitting forbidden minors: Approximation and Kernelization

We study a general class of problems called F-deletion problems. In an F-deletion problem, we are asked whether a subset of at most $k$ vertices can be deleted from a graph $G$ such that the resulting graph does not contain as a minor any graph from the family F of forbidden minors. We obtain a number of algorithmic results on the F-deletion problem when F contains a planar graph. We give (1) a linear vertex kernel on graphs excluding $t$-claw $K_{1,t}$, the star with $t$ leves, as an induced subgraph, where $t$ is a fixed integer. (2) an approximation algorithm achieving an approximation ratio of $O(\log^{3/2} OPT)$, where $OPT$ is the size of an optimal solution on general undirected graphs. Finally, we obtain polynomial kernels for the case when F contains graph $\theta_c$ as a minor for a fixed integer $c$. The graph $\theta_c$ consists of two vertices connected by $c$ parallel edges. Even though this may appear to be a very restricted class of problems it already encompasses well-studied problems such as {\sc Vertex Cover}, {\sc Feedback Vertex Set} and Diamond Hitting Set. The generic kernelization algorithm is based on a non-trivial application of protrusion techniques, previously used only for problems on topological graph classes

A 3d geoscience information system framework

Two-dimensional geographical information systems are extensively used in the geosciences to create and analyse maps. However, these systems are unable to represent the Earth's subsurface in three spatial dimensions. The objective of this thesis is to overcome this deficiency, to provide a general framework for a 3d geoscience information system (GIS), and to contribute to the public discussion about the development of an infrastructure for geological observation data, geomodels, and geoservices. Following the objective, the requirements for a 3d GIS are analysed. According to the requirements, new geologically sensible query functionality for geometrical, topological and geological properties has been developed and the integration of 3d geological modeling and data management system components in a generic framework has been accomplished. The 3d geoscience information system framework presented here is characterized by the following features: - Storage of geological observation data and geomodels in a XML-database server. According to a new data model, geological observation data can be referenced by a set of geomodels. - Functionality for querying observation data and 3d geomodels based on their 3d geometrical, topological, material, and geological properties were developed and implemented as plug-in for a 3d geomodeling user application. - For database queries, the standard XML query language has been extended with 3d spatial operators. The spatial database query operations are computed using a XML application server which has been developed for this specific purpose. This technology allows sophisticated 3d spatial and geological database queries. Using the developed methods, queries can be answered like: "Select all sandstone horizons which are intersected by the set of faults F". This request contains a topological and a geological material parameter. The combination of queries with other GIS methods, like visual and statistical analysis, allows geoscience investigations in a novel 3d GIS environment. More generally, a 3d GIS enables geologists to read and understand a 3d digital geomodel analogously as they read a conventional 2d geological map

Geometrical-topological correlation in structures

The topology of polyhedra, tessellations and networks is described as to their mapping in Schlaefli space. A description of the topological form index is given and it is applied to these structural classes in terms of their geometries

Digital Analytical Geometry: How do I define a digital analytical object?

International audienceThis paper is meant as a short survey on analytically de-ned digital geometric objects. We will start by giving some elements on digitizations and its relations to continuous geometry. We will then explain how, from simple assumptions about properties a digital object should have, one can build mathematical sound digital objects. We will end with open problems and challenges for the future