Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns. We define an insertion order which removes enough randomness to significantly improve performance, but leaves enough randomness so that the algorithms remain theoretically optimal.

The completion mode (individual, collaborative) of the tasks and the conditions under which these modes are performed have been reported to play an important role in language learning. The present study aimed to investigate the effects of employing text editing tasks performed both individually and collaboratively, on the achievement of English grammar under explicit and implicit learning condi...

The problem of multilocus linkage analysis is expressed as a graphical model, making explicit a previously implicit connection, and recent developments in the field are described in this context. A novel application of blocked Gibbs sampling for Bayesian networks is developed to generate inheritance matrices from an irreducible Markov chain. This is used as the basis for reconstruction of histo...

In this paper, we study the intersection problem of two surfaces in which at least one surface is given by its implicit equation Euclidean n-space. We first obtain curvatures transversal curve surfaces. Later, studied for a parametric and an n-dimensional space. Finally, present examples as applications methods.