A Coxeter-Dynkin diagrams in geometry is a graph with labelled edges. It represents the spatial relations between a collection of mirrors (or reflecting hyperplanes), and describes a kaleidoscopic construction.
Here's a new set, built with en:Template:CDD argument sets, allowing 3 vertical levels of nodes, top(a), middle, and bottom(b). It can be used generate all whole numbered Coxeter graphs, finite, affine, and hyperbolic. Ringing nodes is only partially supported for hyperbolic groups. Rational-order mirrors are only partially supported. Tomruen (talk) 23:21, 20 April 2011 (UTC)