12 research outputs found

    GPU-Based Data Processing for 2-D Microwave Imaging on MAST

    Get PDF
    The Synthetic Aperture Microwave Imaging (SAMI) diagnostic is a Mega Amp Spherical Tokamak (MAST) diagnostic based at Culham Centre for Fusion Energy. The acceleration of the SAMI diagnostic data-processing code by a graphics processing unit is presented, demonstrating acceleration of up to 60 times compared to the original IDL (Interactive Data Language) data-processing code. SAMI will now be capable of intershot processing allowing pseudo-real-time control so that adjustments and optimizations can be made between shots. Additionally, for the first time the analysis of many shots will be possible

    Optimal motion of covisible points among obstacles in the plane

    Full text link
    This paper published in the Proceedings of the Integer Programming and Combinatorial Optimization Conference, pp. 457-466. (Eds. Kannan, R. and W.R. Pulleyblank) University of Waterloo Press, Waterloo Ontario, Canada. To appear in the "Journal of Combinatorial Theory" (B

    GPU Accelerated High Accuracy Surface Modelling

    No full text

    Computing shortest path maps with GPU shaders

    No full text

    Finding Optimal Bipartitions of Points and Polygons

    No full text
    We give efficient algorithms to compute an optimal bipartition of a set of points or a set of simple polygons in the plane. In particular, we give an O(n 2 ) algorithm for partitioning a set of n points into two subsets in order to minimize the sum of the perimeters of the convex hulls. We also examine the problems of minimizing the maximum of the perimeters, or the sum/maximum of the areas, for the case in which the partitioning is a line partitioning, induced by some line, and we examine related problems for the bipartitioning of polygons. 1 Introduction In the "bipartition problem", we are interested in partitioning a set S of n points into two subsets (S 1 and S 2 ) in such a way as to optimize some function of the "sizes" (¯(S i )) of the two subsets. Avis ([2]) gave an O(n 2 log n) time algorithm to find a bipartition that minimizes the maximum of the diameters of the sets S 1 and S 2 . Asano, Bhattacharya, Keil and Yao ([1]) improved the bound on the time complexity of t..

    Finding optimal bipartitions of points and polygons

    Full text link
    Finding optimal bipartitions of points and polygon
    corecore