Dappled tiling

07/20/2016
by   Shizuo Kaji, et al.
0

We consider a certain tiling problem of a planar region in which there are no long horizontal or vertical strips consisting of copies of the same tile. Intuitively speaking, we would like to create a dappled pattern with two or more kinds of tiles. We give an efficient algorithm to turn any tiling into one satisfying the condition, and discuss its applications in texturing.

READ FULL TEXT

page 2

page 4

page 5

page 6

page 8

research
08/23/2019

The QuaSEFE Problem

We initiate the study of Simultaneous Graph Embedding with Fixed Edges i...
research
03/16/2023

Characterizations of a Class of Planar Functions over Finite Fields

Planar functions, introduced by Dembowski and Ostrom, have attracted muc...
research
10/13/2019

Face flips in origami tessellations

Given a flat-foldable origami crease pattern G=(V,E) (a straight-line dr...
research
07/31/2023

An Overconstrained Vertical Darboux Mechanism

In this article, we will construct an overconstrained closed-loop linkag...
research
07/06/2021

Practical I/O-Efficient Multiway Separators

We revisit the fundamental problem of I/O-efficiently computing r-way se...
research
10/03/2022

The perturbation bound of the extended vertical linear complementarity problem

In this paper, we discuss the perturbation analysis of the extended vert...
research
12/14/2022

Simplification of Forest Classifiers and Regressors

We study the problem of sharing as many branching conditions of a given ...

Please sign up or login with your details

Forgot password? Click here to reset