English
Related papers

Related papers: Algorithm for planar 4-Body Problem central config…

200 papers

Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…

History and Overview · Mathematics 2025-04-17 Stefan Forcey

The four-spacecraft formation is essential for measurements of various physical fields. The use of this formation on substantially elliptical heliocentric Kepler orbits allows measuring gradients of gravitation field in Solar system. The…

Calculation of the centre of mass of a group of particles in a periodically-repeating cell is an important aspect of chemical and physical simulation. One popular approach calculates the centre of mass via the projection of the individual…

Chemical Physics · Physics 2026-01-05 Harry Richardson , Josh Dunn , Andrew R. McCluskey

We present a method for discovering dense packings of general convex hard particles and apply it to study the dense packing behavior of a one-parameter family of particles with tetrahedral symmetry representing a deformation of the ideal…

Soft Condensed Matter · Physics 2013-01-28 Yoav Kallus , Veit Elser

The relative equilibria of planar Newtonian $N$-body problem become coorbital around a central mass in the limit when all but one of the masses becomes zero. We prove a variety of results about the coorbital relative equilibria, with an…

Dynamical Systems · Mathematics 2022-03-17 Yiyang Deng , Marshall Hampton , Zhiqiang Wang

The construction of algebraic structure of central molecular chirality is provided starting from the empirical Fischer projections for tetrahedrons. A matrix representation is given and the algebra of O(4) orthogonal group for rotations and…

Chemical Physics · Physics 2008-11-26 S. Capozziello , A. Lattanzi

Analytical methods are used to prove the existence of a periodic, symmetric solution with singularities in the planar 4-body problem. A numerical calculation and simulation are used to generate the orbit. The analytical method easily…

Dynamical Systems · Mathematics 2010-02-09 Tiancheng Ouyang , Skyler C. Simmons , Duokui Yan

We present local distributed, stochastic algorithms for \emph{alignment} in self-organizing particle systems (SOPS) on two-dimensional lattices, where particles occupy unique sites on the lattice, and particles can make spatial moves to…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-15 Hridesh Kedia , Shunhao Oh , Dana Randall

The author discusses particular solutions of a second order equation designated by source equation. This equation is special because the metric of the space where it is written is influenced by the solution, rendering the equation…

General Physics · Physics 2007-05-23 Jose B. Almeida

For the Newtonian 4-body problem in space we prove that any zero angular momentum bounded solution suffers infinitely many coplanar instants, that is, times at which all 4 bodies lie in the same plane. This result generalizes a known result…

Dynamical Systems · Mathematics 2019-10-02 Richard Montgomery

Expressions for variables of the center of mass and relative motions for two-body system with different and equal masses in three-dimensional spaces of constant curvature are introduced in the terms of biquaternions. The problem of the…

Mathematical Physics · Physics 2015-07-24 Yu. Kurochkin , Dz. Shoukavy , I. Boyarina

This paper studies the problem of controlling a multi-robot system to achieve a polygon formation in a self-organized manner. Different from the typical formation control strategies where robots are steered to satisfy the predefined control…

Robotics · Computer Science 2023-04-04 Qingkai Yang , Fan Xiao , Jingshuo Lyu , Bo Zhou , Hao Fang

The famous three-body problem can be traced back to Newton in 1687, but quite few families of periodic orbits were found in 300 years thereafter. In this paper, we propose an effective approach and roadmap to numerically gain planar…

Other Computer Science · Computer Science 2022-05-24 Shijun Liao , Xiaoming Li , Yu Yang

We investigate the folding problem that asks if a polygon P can be folded to a polyhedron Q for given P and Q. Recently, an efficient algorithm for this problem has been developed when Q is a box. We extend this idea to regular polyhedra,…

Computational Geometry · Computer Science 2021-06-01 Tonan Kamata , Akira Kadoguchi , Takashi Horiyama , Ryuhei Uehara

The new concept of a system of hex equations is introduced as an overdetermined system of six five-point face-centered quad equations defined on six vertices of a hexagon. For a consistent system of hex equations, two variables on…

Mathematical Physics · Physics 2022-05-06 Andrew P. Kels

In this paper we develop symbolic computation algorithms to investigate finiteness of central configurations for the planar $n$-body problem. Our approach is based on Albouy-Kaloshin's work on finiteness of central configurations for the…

Dynamical Systems · Mathematics 2023-03-07 Ke-Ming Chang , Kuo-Chang Chen

We present a novel solution to the camera pose estimation problem, where rotation and translation of a camera between two views are estimated from matched feature points in the images. The camera pose estimation problem is traditionally…

Computer Vision and Pattern Recognition · Computer Science 2018-07-31 Kaveh Fathian , J. Pablo Ramirez-Paredes , Emily A. Doucette , J. Willard Curtis , Nicholas R. Gans

This study presents a general alternative scheme of the procedure and necessary conditions for solving the $n$-body problem. The presented solution is not a solution of the classical problem, where the initial conditions of positions and…

Earth and Planetary Astrophysics · Physics 2025-07-24 Pawel Wojda

We present new and efficient quadrature rules for computing the stiffness matrices of mass-lumped tetrahedral elements for wave propagation modelling. These quadrature rules allow for a more efficient implementation of the mass-lumped…

Numerical Analysis · Mathematics 2020-02-05 S. Geevers , W. A. Mulder , J. J. W. van der Vegt

Let P be a set of n points in R^3. The 2-center problem for P is to find two congruent balls of minimum radius whose union covers P. We present two randomized algorithms for computing a 2-center of P. The first algorithm runs in O(n^3 log^5…

Computational Geometry · Computer Science 2010-12-14 Pankaj K. Agarwal , Rinat Ben Avraham , Micha Sharir