38 research outputs found

    Giant Planet Formation and Migration

    Get PDF
    © 2018, The Author(s). Planets form in circumstellar discs around young stars. Starting with sub-micron sized dust particles, giant planet formation is all about growing 14 orders of magnitude in size. It has become increasingly clear over the past decades that during all stages of giant planet formation, the building blocks are extremely mobile and can change their semimajor axis by substantial amounts. In this chapter, we aim to give a basic overview of the physical processes thought to govern giant planet formation and migration, and to highlight possible links to water delivery.S.-J. Paardekooper is supported by a Royal Society University Research Fellowship. A. Johansen is supported by the Knut and Alice Wallenberg Foundation, the Swedish Research Council (grant 2014-5775) and the European Research Council (ERC Starting Grant 278675-PEBBLE2PLANET)

    Connecting Planetary Composition with Formation

    Full text link
    The rapid advances in observations of the different populations of exoplanets, the characterization of their host stars and the links to the properties of their planetary systems, the detailed studies of protoplanetary disks, and the experimental study of the interiors and composition of the massive planets in our solar system provide a firm basis for the next big question in planet formation theory. How do the elemental and chemical compositions of planets connect with their formation? The answer to this requires that the various pieces of planet formation theory be linked together in an end-to-end picture that is capable of addressing these large data sets. In this review, we discuss the critical elements of such a picture and how they affect the chemical and elemental make up of forming planets. Important issues here include the initial state of forming and evolving disks, chemical and dust processes within them, the migration of planets and the importance of planet traps, the nature of angular momentum transport processes involving turbulence and/or MHD disk winds, planet formation theory, and advanced treatments of disk astrochemistry. All of these issues affect, and are affected by the chemistry of disks which is driven by X-ray ionization of the host stars. We discuss how these processes lead to a coherent end-to-end model and how this may address the basic question.Comment: Invited review, accepted for publication in the 'Handbook of Exoplanets', eds. H.J. Deeg and J.A. Belmonte, Springer (2018). 46 pages, 10 figure

    Pebble-trapping Backreaction Does Not Destroy Vortices

    No full text
    The formation of planets remains one of the most challenging problems of contemporary astrophysics. Starting with micron-sized dust grains, coagulation models predict growth up to centimeter (pebbles), but growth beyond this size is difficult because of fragmentation and drift. Ways to bypass this problem have focused on inhomogeneities in the flow, be that zonal flows, streaming instability, or vortices. Because vortices are in equilibrium between the Coriolis and the pressure force, the pressureless grains will orbit along a vortex streamline experiencing a drag force. This is a very effective mechanism to concentrate pebbles as also seen in numerical simulations and possibly in ALMA observations. Yet, a high pebble load is dangerous for the vortex, and we showed that in two-dimensional simulations the backreaction eventually leads to vortex disruption. We investigate whether the same happens in three dimensions. We perform 3D simulations with pebbles in a local box finding that, although the pebbles disturb the vortex around the midplane, the column does not get destroyed. This result is important because, based on the previous 2D result suggesting complete disruption, the vortex interpretation of ALMA observations has been called into question. We show instead that the vortex behaves like a Taylor column, and the pebbles as obstacles to the flow. Pebble accumulation in the center of the vortices proceeds to roughly the same concentration as in the control run without backreaction

    Delaunay Walk for Fast Nearest Neighbor: Accelerating Correspondence Matching for ICP

    Get PDF
    Point set registration algorithms such as Iterative Closest Point (ICP) are commonly utilized in time-constrained environments like robotics. Finding the nearest neighbor of a point in a reference 3D point set is a common operation in ICP and frequently consumes at least 90% of the computation time. We introduce a novel approach to performing the distance-based nearest neighbor step based on Delaunay triangulation. This greedy algorithm finds the nearest neighbor of a query point by traversing the edges of the Delaunay triangulation created from a reference 3D point set. Our work integrates the Delaunay traversal into the correspondences search of ICP and exploits the iterative aspect of ICP by caching previous correspondences to expedite each iteration. An algorithmic analysis and comparison is conducted showing an order of magnitude speedup for both serial and vector processor implementation

    Delaunay Walk for Fast Nearest Neighbor: Accelerating Correspondence Matching for ICP

    No full text
    Point set registration algorithms such as Iterative Closest Point (ICP) are commonly utilized in time-constrained environments like robotics. Finding the nearest neighbor of a point in a reference 3D point set is a common operation in ICP and frequently consumes at least 90% of the computation time. We introduce a novel approach to performing the distance-based nearest neighbor step based on Delaunay triangulation. This greedy algorithm finds the nearest neighbor of a query point by traversing the edges of the Delaunay triangulation created from a reference 3D point set. Our work integrates the Delaunay traversal into the correspondences search of ICP and exploits the iterative aspect of ICP by caching previous correspondences to expedite each iteration. An algorithmic analysis and comparison is conducted showing an order of magnitude speedup for both serial and vector processor implementation
    corecore