Related Experiment Video
Updated: Dec 31, 2025

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
Published on: March 18, 2019
Perfect k-Colored Matchings and ( k + 2 ) -Gonal Tilings
Oswin Aichholzer1, Lukas Andritsch2, Karin Baur2
11Institute of Software Technology, Graz University of Technology, Graz, Austria.
None:
We derive a simple bijection between geometric plane perfect matchings on 2n points in convex position and triangulations on points in convex position. We then extend this bijection to monochromatic plane perfect matchings on periodically k-colored vertices and -gonal tilings of convex point sets. These structures are related to a generalization of Temperley-Lieb algebras and our bijections provide explicit one-to-one relations between matchings and tilings. Moreover, for a given element of one class, the corresponding element of the other class can be computed in linear time.
Related Concept Videos
Coordination Number and Geometry
Lattice Centering and Coordination Number
Types of Unit Cells
Imagine taking a large number of identical...
Geometry of Hyperbolas
Theorems of Pappus and Guldinus: Problem Solving
Graphical Representation of Inequalities
Sign Test for Matched Pairs
To conduct the sign test, we first calculate the differences in...

