This paper establishes a number of mathematical results relevant to the problem of constructing a triangulation, i.e., a simplical tessellation of the convex hull of an arbitrary finite set of points in n-space. The principal results of the present paper are: (1) a set of n + 2 points in n-space may be triangulated in at most 2 different ways; (2) the 'sphere test' defined in this paper selects a preferred one of these two triangulations; (3) a set of parameters is defined that permits the characterization and enumeration of all sets on n + 2 points in n-space that are significantly different from the point of view of their possible triangulations; and (4) the local sphere test induces a global sphere test property for a triangulation.