One can make a polyhedral Voronoi diagram mesh by dualizing a Delaunay triangulation simplicial mesh. TIN are based on a Delaunay triangulation or constrained Delaunay. Computing either the Delaunay triangulation or the Voronoi diagram takes time. It is a subgraph of the Delaunay triangulation. The Voronoi diagram of a set of points is dual to its Delaunay triangulation. Particularly important were the development of triangulation and other methods to determine mapping locations accurately. For triangulation or multiangulation, calculation is done based on angles. It is the first map to be based on a geodesic triangulation. We consider the corner points of the tree cells as vertices in our triangulation. These include calculating the trajectory of a bullet by triangulation. Each small triangle becomes a node in the new graph derived from the triangulation. This observation leads to the problem which is solved in triangulation. The accuracy of triangulation range finders is on the order of tens of micrometers. This approach generalizes to any "n"-manifold having a triangulation. Highest in the hierarchy were triangulation networks.