We present a Conforming Delaunay Triangulation (CDT) algorithm based on maximal Poisson disk sampling. Points are unbiased, meaning the probability of introducing a vertex in a disk-free subregion is proportional to its area, except in a neighborhood of the domain boundary. In contrast, Delaunay refinement CDT algorithms place points dependent on the geometry of empty circles in intermediate tr...

For certain kinds of statistical simulations and Bayesian analyses, it is necessary to generate random samples from multivariate distributions. SAS/IML software provides the RANDGEN function for generating random samples from univariate distributions. However, the only subroutine for sampling from multivariate distributions is SAS/IML’s VNORMAL call, which samples from multivariate normal distr...

A heuristic method for solving large-scale multi–facility location problems is presented. The method is analogous to Cooper’s method [3], using the authors’ single facility location method [20] as a parallel subroutine, and reassigning customers to facilities using the heuristic of Nearest Center Reclassification. Numerical results are reported.

We study the problem of hierarchical clustering on planar graphs. We formulate this in terms of an LP relaxation of ultrametric rounding. To solve this LP efficiently we introduce a dual cutting plane scheme that uses minimum cost perfect matching as a subroutine in order to efficiently explore the space of planar partitions. We apply our algorithm to the problem of hierarchical image segmentat...

Determining visibility in planar polygons and arrangements is an important subroutine for many algorithms in computational geometry. In this paper, we report on new implementations, and corresponding experimental evaluations, for two established and one novel algorithm for computing visibility polygons. These algorithms will be released to the public shortly, as a new package for the Computatio...

addresses used in the electronic interface are not available , the address buffering and decoding logic (figure 4) must be modified to decode an available memory address. The hardcopy of the date line 599-600 (BASIC program, table 3) will have to be modified to correspond to the syntax of the computer. For graphical output a printer-specific subroutine will have to be written.

Our main goal in this paper is to give molecular solutions for two NP–complete problems, namely Subset-sum and Knapsack, in a sticker based model for DNA computations. In order to achieve this, we have used a finite set sorting subroutine together with the description of a procedure to formally verify the designed programs through the labeling of test tubes using inductive techniques.

The Monte Carlo code MCNPX has been utilized to calculate the effective delayed neutron fraction and reactivity by using the area-ratio method. The effective delayed neutron fraction eff has been calculated with the fission probability method proposed by Meulekamp and van der Marck. MCNPX was used to calculate separately the fission probability of the delayed and the prompt neutrons by using th...