The Physics of Cluster Mergers

Clusters of galaxies generally form by the gravitational merger of smaller clusters and groups. Major cluster mergers are the most energetic events in the Universe since the Big Bang. Some of the basic physical properties of mergers will be discussed, with an emphasis on simple analytic arguments rather than numerical simulations. Semi-analytic estimates of merger rates are reviewed, and a simple treatment of the kinematics of binary mergers is given. Mergers drive shocks into the intracluster medium, and these shocks heat the gas and should also accelerate nonthermal relativistic particles. X-ray observations of shocks can be used to determine the geometry and kinematics of the merger. Many clusters contain cooling flow cores; the hydrodynamical interactions of these cores with the hotter, less dense gas during mergers are discussed. As a result of particle acceleration in shocks, clusters of galaxies should contain very large populations of relativistic electrons and ions. Electrons with Lorentz factors gamma~300 (energies E = gamma m_e c^2 ~ 150 MeV) are expected to be particularly common. Observations and models for the radio, extreme ultraviolet, hard X-ray, and gamma-ray emission from nonthermal particles accelerated in these mergers are described.Comment: 38 pages with 9 embedded Postscript figures. To appear in Merging Processes in Clusters of Galaxies, edited by L. Feretti, I. M. Gioia, and G. Giovannini (Dordrecht: Kluwer), in press (2001

Incrementally Constructing and Updating Constrained Delaunay Tetrahedralizations with Finite Precision Coordinates

Summary. Constrained Delaunay tetrahedralizations (CDTs) are valuable for generating meshes of nonconvex domains and domains with internal boundaries, but they are difficult to maintain robustly when finite-precision coordinates yield vertices on a line that are not perfectly collinear and polygonal facets that are not perfectly flat. We experimentally compare two recent algorithms for inserting a polygonal facet into a CDT: a bistellar flip algorithm of Shewchuk (Proc. 19th Annual Symposium on Computational Geometry, June 2003) and a cavity retriangulation algorithm of Si and Gärtner (Proc. Fourteenth International Meshing Roundtable, September 2005). We modify these algorithms to succeed in practice for polygons whose vertices deviate from exact coplanarity.

Computing 3D Periodic Triangulations

apport de recherch