Log In Sign Up

A linear algorithm for Brick Wang tiling

The Wang tiling is a classical problem in combinatorics. A major theoretical question is to find a (small) set of tiles which tiles the plane only aperiodically. In this case, resulting tilings are rather restrictive. On the other hand, Wang tiles are used as a tool to generate textures and patterns in computer graphics. In these applications, a set of tiles is normally chosen so that it tiles the plane or its sub-regions easily in many different ways. With computer graphics applications in mind, we introduce a class of such tileset, which we call sequentially permissive tilesets, and consider tiling problems with constrained boundary. We apply our methodology to a special set of Wang tiles, called Brick Wang tiles, introduced by Derouet-Jourdan et al. in 2015 to model wall patterns. We generalise their result by providing a linear algorithm to decide and solve the tiling problem for arbitrary planar regions with holes.


page 1

page 2

page 3

page 4


Procedural Wang Tile Algorithm for Stochastic Wall Patterns

The game and movie industries always face the challenge of reproducing m...

Linear Size Planar Manhattan Network for Convex Point Sets

Let G = (V, E) be an edge-weighted geometric graph such that every edge ...

Tiling Rectangles and the Plane using Squares of Integral Sides

We study the problem of perfect tiling in the plane and exploring the po...

Stabbing Pairwise Intersecting Disks by Four Points

Following the seminal works of Danzer (1956, 1986) and Stachó (1965,1981...

Visualizing Astronomical Data with Blender

Astronomical data take on a multitude of forms -- catalogs, data cubes, ...

Symmetry Detection of Occluded Point Cloud Using Deep Learning

Symmetry detection has been a classical problem in computer graphics, ma...

Synchronized Planarity with Applications to Constrained Planarity Problems

We introduce the problem Synchronized Planarity. Roughly speaking, its i...

Code Repositories