This paper brings together two sets of writing under development, but with common themes of rejection of concepts of unity, coherence and singularity that characterize modernity. However, they also reject the notions of fragmented individualism and nihilism that are seen in much postmodern thinking. In our search for ways of facilitating generation of meaning within and for those thinking/actin...

Watson (2003: 168) claims that ‘although increasing academic attention is being paid to business ethics, the ways in which ethical consideration come into activities and decisions of organizational managers have been examined in a very limited way’. This article contributes by suggesting an interesting way to study moral managerial decisions is studying these decisions in their discursive conte...

We study the problem of acute triangulations of convex polyhedra and the space Rn. 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 Rn do not exist for n ≥ 5. In the opposite direction, in R3, we present a construction of...

We describe a method to triangulate P × Q which is very useful to obtain triangulations of the d-cube I of good asymptotic efficiency. The main idea is to triangulate P × Q from a triangulation of Q and another of P ×∆, where ∆ is a simplex of dimension m− 1, which is supposed to be smaller than dim(Q) = n− 1. Last triangulation will induce a triangulation of P ×∆. Thus, considering P := I and ...

A view-dependent multiresolution triangulation algorithm is presented for a real-time flythrough. The triangulation of the terrain is generated incrementally onthe-fly during the rendering time. We show that since the view changes smoothly only a few incremental modifications are required to update the triangulation to a new view. The resulting triangles form a multiresolution Delaunay triangul...

Considering the problem of the minimal triangulation for a given polyhedra (dividing polyhedra into tetrahedra) it is known that the cone triangulation provides the number of tetrahedra which is the smallest, or the closest to it. It is also shown that when we want to know whether the cone triangulation is the minimal one, it is necessary to find the order of all vertices, as well as the order ...

We introduce the notion of generalized Delaunay triangulation of a planar straight-line graph G = (V, E) in the Euclidean plane and present some characterizations of the triangulation. It is shown that the generalized Delaunay triangulation has the property that the minimum angle of the triangles in the triangulation is maximum among all possible triangulations of the graph. A general algorithm...

It is shown that there exists a dihedral acute triangulation of the three-dimensional cube. The method of constructing the acute triangulation is described, and symmetries of the triangulation are discussed.

In this paper I critically discuss the pros and cons of working with research brokers from a political science perspective. do by sharing my experiences collaborating two types local “fixers” – cultural communal brokers. argue that even if similar approaches risk introducing number broker-induced biases, countermeasures can be taken to mitigate their effect: e.g. continuous triangulation, inter...

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...