277,019 research outputs found

    ParGeo: A Library for Parallel Computational Geometry

    Get PDF

    Minimizing the stabbing number of matchings, trees, and triangulations

    Full text link
    The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. This paper deals with finding perfect matchings, spanning trees, or triangulations of minimum stabbing number for a given set of points. The complexity of these problems has been a long-standing open question; in fact, it is one of the original 30 outstanding open problems in computational geometry on the list by Demaine, Mitchell, and O'Rourke. The answer we provide is negative for a number of minimum stabbing problems by showing them NP-hard by means of a general proof technique. It implies non-trivial lower bounds on the approximability. On the positive side we propose a cut-based integer programming formulation for minimizing the stabbing number of matchings and spanning trees. We obtain lower bounds (in polynomial time) from the corresponding linear programming relaxations, and show that an optimal fractional solution always contains an edge of at least constant weight. This result constitutes a crucial step towards a constant-factor approximation via an iterated rounding scheme. In computational experiments we demonstrate that our approach allows for actually solving problems with up to several hundred points optimally or near-optimally.Comment: 25 pages, 12 figures, Latex. To appear in "Discrete and Computational Geometry". Previous version (extended abstract) appears in SODA 2004, pp. 430-43

    Computational Geometry Applications

    Get PDF
    Computational geometry is an integral part of mathematics and computer science deals with the algorithmic solution of geometry problems. From the beginning to today, computer geometry links different areas of science and techniques, such as the theory of algorithms, combinatorial and Euclidean geometry, but including data structures and optimization. Today, computational geometry has a great deal of application in computer graphics, geometric modeling, computer vision, and geodesic path, motion planning and parallel computing. The complex calculations and theories in the field of geometry are long time studied and developed, but from the aspect of application in modern information technologies they still are in the beginning. In this research is given the applications of computational geometry in polygon triangulation, manufacturing of objects with molds, point location, and robot motion planning

    Turbulent shear layers in confining channels

    Full text link
    We present a simple model for the development of shear layers between parallel flows in confining channels. Such flows are important across a wide range of topics from diffusers, nozzles and ducts to urban air flow and geophysical fluid dynamics. The model approximates the flow in the shear layer as a linear profile separating uniform-velocity streams. Both the channel geometry and wall drag affect the development of the flow. The model shows good agreement with both particle-image-velocimetry experiments and computational turbulence modelling. The low computational cost of the model allows it to be used for design purposes, which we demonstrate by investigating optimal pressure recovery in diffusers with non-uniform inflow

    An HPC-Based Approach to Study Living System Computational Model Parameter Dependency

    Full text link
    High performance computing (HPC) allows one to run in parallel large amount of independent numerical experiments for computationally intensive simulations of a complex system. Results of such experiments can be used to derive dependencies between functional characteristics of simulated system and parameters of the computational model. In this paper, we implemented this HPC approach with using a computational model of the electrical activity in the left ventricle of human heart. To illustrate possibilities of the approach, we analyzed dependencies of electrophysiological characteristics of the left ventricle on the parameters of its geometry. Particularly, we identified a dependence of the dynamics of activated myocardium part during excitation on the model parameters of the myocardial fiber orientation in the ventricular wall

    FluSI: A novel parallel simulation tool for flapping insect flight using a Fourier method with volume penalization

    Full text link
    FluSI, a fully parallel open source software for pseudo-spectral simulations of three-dimensional flapping flight in viscous flows, is presented. It is freely available for non-commercial use under [https://github.com/pseudospectators/FLUSI]. The computational framework runs on high performance computers with distributed memory architectures. The discretization of the three-dimensional incompressible Navier--Stokes equations is based on a Fourier pseudo-spectral method with adaptive time stepping. The complex time varying geometry of insects with rigid flapping wings is handled with the volume penalization method. The modules characterizing the insect geometry, the flight mechanics and the wing kinematics are described. Validation tests for different benchmarks illustrate the efficiency and precision of the approach. Finally, computations of a model insect in the turbulent regime demonstrate the versatility of the software
    corecore