n-Dimensional congruent lattices using necklaces

نویسندگان

چکیده

• Methodology devised for the generation of congruent distributions in modular spaces. Formulation problem terms Number Theory. Mathematical generalization Walker, Draim, and Flower Constellations. Devised optimization techniques distribution problems. The methodology allows to limit size searching space. This work introduces n -dimensional lattices using necklaces, a general generate uniform multidimensional formulation presented this manuscript constitutes mathematical foundation most used satellite constellation designs, including Walker Constellations, Lattice Necklace These design models are based on Theory allow obtain that have some interesting properties uniformity large number symmetries. includes complete methodology, proofs existence uniqueness definitions, several theorems focus counting possibilities common cases study.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three-dimensional Texturing Using Lattices

This paper describes a way to perform realistic three-dimensional texturing of ray-traced objects with irregular surfaces. Such texturing has been done in the past with texture mapping, particle systems, or volumetric methods. We propose an alternative to these called a lattice. Lattices work as fast but inexact ray tracers. As long as lattices are used for small objects, though, the inexactnes...

متن کامل

Robust surface registration using N-points approximate congruent sets

Scans acquired by 3D sensors are typically represented in a local coordinate system. When multiple scans, taken from different locations, represent the same scene these must be registered to a common reference frame. We propose a fast and robust registration approach to automatically align two scans by finding two sets of N -points, that are approximately congruent under rigid transformation an...

متن کامل

Territory covered by N Lévy flights on d-dimensional lattices

We study the territory covered by N Lévy flights by calculating the mean number of distinct sites, ^SN(n)&, visited after n time steps on a d-dimensional, d>2, lattice. The Lévy flights are initially at the origin and each has a probability Al 2(d1a) to perform an l -length jump in a randomly chosen direction at each time step. We obtain asymptotic results for different values of a . For d52 an...

متن کامل

One Dimensional Topological Lattices

The lattice theoretic terminology used in this paper is consistent with Birkhoff [2]. The topological terms can be found in [5] or [8] with the following exceptions. If X and Y are sets, X\Y denotes the relative compliment of Y with respect to X. If A is a subset of a topological space then A*, A"and FiA)=A*\A° denote the topological closure, interior and boundary of A. The symbol 0 denotes the...

متن کامل

Generating Necklaces

A k color n bead necklace is an equivalence class of k ary n tuples under rotation In this paper we analyze an algorithm due to Fredricksen Kessler and Maiorana FKM to show that necklaces can be generated in constant amortized time We also present a new approach to generating necklaces which we conjecture can also be implemented in constant amortized time The FKM algorithm generates a list of n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Space Research

سال: 2021

ISSN: ['0273-1177', '1879-1948']

DOI: https://doi.org/10.1016/j.asr.2020.04.045