A fast and easy to implement divide-and-conquer algorithm is presented for the construction of the Constrained Delaunay triangulation of a polygonal domain. The algorithm simplifies the complicated merging step inherent to divide-and-conquer algorithms for the computation of triangulations. Furthermore, no triangles are computed outside the valid region of the domain. A grid structure accelerat...

Divide-and-conquer functions satisfy equations in F(z), F(z2), F(z4) . . .. Their generated sequences are mainly used in computer science, and they were analyzed pragmatically, that is, now and then a sequence was picked out for scrutiny. By giving several classes of ordinary generating functions togetherwith recurrences, we hope to helpwith the analysis of many such sequences, and try to class...

Separate-and-conquer classifiers strongly depend on the criteria used to choose which rules will be included in the classification model. When association rules are employed to build such classifiers (as in ART [3]), rule evaluation can be performed attending to different criteria (other than the traditional confidence measure used in association rule mining). In this paper, we analyze the desi...

The paper addresses the design of program visualizations adequate to represent divideand-conquer algorithms. Firstly, we present the results of several surveys performed on the visualization of divide-and-conquer algorithms in the literature. Secondly, we make a proposal for three complementary, coordinated views of these algorithms. In summary, they are based an animation of the activation tre...

This paper introduces a divide and conquer approach for organizing the adaptation of distributed applications in a potentially large number of interacting middleware instances. In such an environment, a centralistic and static adaptation reasoning i) is inadequate and ii) gives the same priority to all applications. The divide and conquer method aims at minimizing the interference between runni...

In this paper a new implementation of a divide and conquer algorithm will be considered. This algorithm, in contrast to the LAPACK algorithm, uses a diierent formulation of the update problem, and extended precision in order to maintain accuracy and orthogonality. Our Intel Paragon implementation shows, in contrast to the Hypercube implementation by Ipsen and Jessup 14], that good speedups can ...

Divide and Conquer is a well known algorithmic procedure for solving many kinds of problem. In this procedure, the problem is partitioned into two parts until the problem is trivially solvable. Finding the distance of the closest pair is an interesting topic in computer science. With divide and conquer algorithm we can solve closest pair problem. Here also the problem is partitioned into two pa...