Search Results for ""

A convex figure constructed by iteratively halving the base of an equilateral triangle and then sliding adjacent triangles so that they slightly overlap. Combining several ...

A theorem which plays a fundamental role in computer science because it is one of the main tools for showing that certain orderings on trees are well-founded. These orderings ...

The boundaries of the cells of a Voronoi diagram.

An oval whose construction is illustrated in the above diagram.

A limb of a tree at a vertex v is the union of one or more branches at v in the tree. v is then called the base of the limb.

A knot diagram which does not specify whether crossings are under- or overcrossings.

The vertex height of a vertex v in a rooted tree is the number of edges on the longest downward path between v and a tree leaf. The height of the root vertex of a rooted tree ...

Two links can be continuously deformed into each other iff any diagram of one can be transformed into a diagram of the other by a sequence of Reidemeister moves.

A crossing in a knot diagram for which there exists a circle in the projection plane meeting the diagram transversely at that crossing, but not meeting the diagram at any ...

A tree spread in which each node has a finite number of children.