For example, the sample points of a polyhedral obstacle can be the vertices of the polyhedron.
We say that two vertices of a graph are uniquely connected if there is precisely one arc that connects them.
These authors reproduced a number of experimental observations using triangulated surfaces with elastic (stretching) and bending energy, where each capsomer is represented by several vertices.
The object used in the experiment has 40 vertices, which are all used as feature points.
It is assumed that the window vertices lie on a plane and are stationary at a specified position and orientation.
If the associated proof structure of has no border vertices, must be simple.
Non-terminal elements are called hyperarcs, and terminal elements are vertices and edges.
Any two vertices may either be linked by one edge or not be linked at all.
