TOPICS
Search

Search Results for ""


181 - 190 of 999 for Polytope EdgeSearch Results
The tetragonal trapezohedron is the dual of the square antiprism. For a square antiprism with unit edge lengths, the edge lengths of the corresponding tetragonal ...
The polyhedron compound of the truncated dodecahedron and its dual, the triakis icosahedron. The compound can be constructed from a truncated dodecahedron of unit edge length ...
The polyhedron compound of the truncated icosahedron and its dual, the pentakis dodecahedron. The compound can be constructed from a truncated icosahedron of unit edge length ...
Let S be a set of simple polygonal obstacles in the plane, then the nodes of the visibility graph of S are just the vertices of S, and there is an edge (called a visibility ...
Several differing definitions of almost planar (as well as nearly planar) have been used in the literature (cf. Lipton et al. 2016). For example, Gubser (1996) defines an ...
The deltoidal icositetrahedron is the 24-faced dual polyhedron of the small rhombicuboctahedron A_6 and Wenninger dual W_(13). It is also called the trapezoidal ...
A graph in which each graph edge is replaced by a directed graph edge, also called a digraph. A directed graph having no multiple edges or loops (corresponding to a binary ...
The Hungarian algorithm finds a maximum independent edge set on a graph. The algorithm starts with any matching M and constructs a tree via a breadth-first search to find an ...
In general, a triakis tetrahedron is a non-regular dodecahedron that can be constructed as a positive augmentation of a regular tetrahedron. Such a solid is also known as a ...
A causal network is an acyclic digraph arising from an evolution of a substitution system, and representing its history. The illustration above shows a causal network ...
1 ... 16|17|18|19|20|21|22 ... 100 Previous Next

...