Triangulations and tetrahedrizations are important geometrical discretization procedures applied to several areas, such as the reconstruction of surfaces and data visualization. Delaunay and Voronoi tessellations are discretization structures of domains with desirable geometrical properties. In this work, a systematic review of algorithms with linear-time behaviour to generate 2D/3D Delaunay an...

During the past few years we have obtained several new computer classification results on association schemes and in particular distance regular and strongly regular graphs. Central to our success is the use of two algebraic constraints based on properties of the minimal idempotents Ei of these association schemes : the fact that they are positive semidefinite and that they have known rank. Inc...

3 In this paper, we give a complete characterization of binary matroids 4 with no P9-minor. A 3-connected binary matroid M has no P9-minor 5 if and only if M is one of the internally 4-connected non-regular minors 6 of a special 16-element matroid Y16, a 3-connected regular matroid, a 7 binary spike with rank at least four, or a matroid obtained by 3-summing 8 copies of the Fano matroid to a 3-...

We consider random tessellations T in R2 and Coxian point processes whose driving measure is concentrated on the edges of T . In particular, we discuss several classes of Poisson-type tessellations which can describe e.g. the infrastructure of telecommunication networks, whereas the Cox processes on their edges can describe the locations of network components. An important quantity associated w...