Given a convex polygon with n vertices in the plane, we are interested in triangulations of its interior, i.e., maximal sets of nonintersecting diagonals that subdivide the interior of the polygon into triangles. The MaxMin area triangulation is the triangulation of the polygon that maximizes the area of the smallest triangle in the triangulation. Similarly, the MinMax area triangulation is the...

The present concept of stress is related with the necessity of triangulation in research. Triangulation means collecting evidence of stress from at least three sources: (a) precursors--perception and feeling (moderating factors), (b) direct consequences, (c) state of health. Is it possible to implement triangulation in the investigations of work-related stress at sea? In the present paper, poss...

where i is the linear interpolation of f over the triangle Ti in T and the sum is over all triangles in the triangulation. One may consider changing the triangulation by exchanging two triangles joined by an edge, forming a quadrilateral, by the triangles obtained by switching the diagonal of the quadrilateral; this is called an edge ‡ip or a 2 ! 2 bistellar ‡ip. He showed that the roughness of...

Minimum Fill-in is a fundamental and classical problem arising in sparse matrix computations. In terms of graphs it can be formulated as a problem of finding a triangulation of a given graph with the minimum number of edges. By the classical result of Rose, Tarjan, Lueker, and Ohtsuki from 1976, an inclusion minimal triangulation of a graph can be found in polynomial time but, as it was shown b...