The paper is the first report on approximation algorithms for computing the maximum weight triangulation of a set of n points in the plane. We prove an Ω( √ n) lower bound on the approximation factor for several heuristics: maximum greedy triangulation, maximum greedy spanning tree triangulation and maximum spanning tree triangulation. We then propose the Spoke Triangulation algorithm, which al...

Triangulating a given n-vertex simple polygon means to partition the interior of the polygon into n − 2 triangles by adding n − 3 nonintersecting diagonals. Significant theoretical advances have recently been made in finding efficient polygon triangulation algorithms. However, there is substantial effort being made in finding a simple and practical triangulation algorithm. We propose the concep...

ONF, 41(5), 545–547. doi: 10.1188/14.ONF.545-547 Triangulation refers to the use of multiple methods or data sources in qualitative research to develop a comprehensive understanding of phenomena (Patton, 1999). Triangulation also has been viewed as a qualitative research strategy to test validity through the convergence of information from different sources. Denzin (1978) and Patton (1999) iden...

Digital aerial triangulation is increasingly being carried out in photogrammetric production environments as greater efficiency is being attained through increased automation. In this paper, a customised and modified approach to digital aerial triangulation using the Helava Automated Triangulation System (HATS) is introduced. HATS is used as the basic triangulation measurement tool for the aeri...