The purpose of this paper is to generalize the Delaunay[13] triangulation onto surfaces. A formal definition and an appropriate algorithm are presented. Starting from a plane domain Delaunay triangulation definition, a theoretical approach is evolved (which is a background for further considerations). It has been proven that, in the case of a plane surface, the introduced Delaunay triangulation...

the use of a single research method design can hardly bring to light multiple aspects of a social phenomenon. the interdisciplinary characteristics of organization and management, requires the student of the field to go beyond traditional approaches normally used in social science studies. the researcher has to apply triangulation in order to unmusk many facets of organizational phenomenon. thi...

washback refers to the influence of a test on teaching and learning. this study was an attempt to compare the influence of ielts and toefl ibt on the expectations the students brought to their courses and to investigate how these expectations were fulfilled. to this end, 100 ielts and 120 toefl ibt students attending preparation courses took a questionnaire survey, and a sample of their ten cla...

The notion of a layered triangulation of a lens space was defined by Jaco and Rubinstein in [6], and, unless the lens space is L(3,1), a layered triangulation with the minimal number of tetrahedra was shown to be unique and termed its minimal layered triangulation. This paper proves that for each n ≥ 2, the minimal layered triangulation of the lens space L(2n,1) is its unique minimal triangulat...

This paper describes an optimal triangulation algorithm for rectangles. We derive lower bounds on the maximum degree of triangulation, and show that our triangulation algorithm matches the lower bounds. Several important observations are also made, including a zig-zag condition that can verify whether a triangulation can minimizes the maximum degree to 4 or not. In addition, this paper identifi...

The paper presents two techniques to convert raster images in a Scalable Vector Graphics format. The first method is a technique that generates a Data Dependent Triangulation just by swapping the edges generated by a regular triangulation; the second technique is a Wavelet Based Triangulation and generates a multi-level triangulation based on the data collected from the wavelet multi-level tran...

We study the problem of acute triangulations of convex polyhedra and the space R. Here an acute triangulation is a triangulation into simplices whose dihedral angles are acute. We prove that acute triangulations of the n-cube do not exist for n≥4. Further, we prove that acute triangulations of the space R do not exist for n≥5. In the opposite direction, in R, we present a construction of an acu...