scholarly journals Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons

Symmetry ◽  
2018 ◽  
Vol 10 (10) ◽  
pp. 477
Author(s):  
Jianqiang Hao ◽  
Jianzhi Sun ◽  
Yi Chen ◽  
Qiang Cai ◽  
Li Tan
Keyword(s):  
Parallel Implementation ◽  
Dimensional Space ◽  
Three Dimensional ◽  
Geometric Probability ◽  
Boolean Operations ◽  
Straight Line ◽  
Speed Up ◽  
The Stability ◽  
Serial Algorithm ◽  
Degenerate Cases

This paper provides a full theoretical and experimental analysis of a serial algorithm for the point-in-polygon test, which requires less running time than previous algorithms and can handle all degenerate cases. The serial algorithm can quickly determine whether a point is inside or outside a polygon and accurately determine the contours of input polygon. It describes all degenerate cases and simultaneously provides a corresponding solution to each degenerate case to ensure the stability and reliability. This also creates the prerequisites and basis for our novel boolean operations algorithm that inherits all the benefits of the serial algorithm. Using geometric probability and straight-line equation F ( P ) = ( y i − y i + 1 ) ( x p − x i ) − ( y i − y p ) ( x i + 1 − x i ) , it optimizes our two algorithms that avoid the division operation and do not need to compute any intersection points. Our algorithms are applicable to any polygon that may be self-intersecting or with holes nested to any level of depth. They do not have to sort the vertices clockwise or counterclockwise beforehand. Consequently, they process all edges one by one in any order for input polygons. This allows a parallel implementation of each algorithm to be made very easily. We also prove several theorems guaranteeing the correctness of algorithms. To speed up the operations, we assign each vector a number code and derive two iterative formulas using differential calculus. However, the experimental results as well as the theoretical proof show that our serial algorithm for the point-in-polygon test is optimal and the time complexities of all algorithms are linear. Our methods can be extended to three-dimensional space, in particular, they can be applied to 3D printing to improve its performance.

Quaternionic Neural Networks

2009 ◽  
pp. 411-439 ◽  
Author(s):  
Teijiro Isokawa ◽  
Nobuyuki Matsui ◽  
Haruhiko Nishimura
Keyword(s):  
Neural Networks ◽  
Dimensional Space ◽  
Three Dimensional ◽  
Network Models ◽  
Recurrent Network ◽  
Affine Transformations ◽  
Neural Network Models ◽  
Fundamental Properties ◽  
Modern Physics ◽  
The Stability

Quaternions are a class of hypercomplex number systems, a four-dimensional extension of imaginary numbers, which are extensively used in various fields such as modern physics and computer graphics. Although the number of applications of neural networks employing quaternions is comparatively less than that of complex-valued neural networks, it has been increasing recently. In this chapter, the authors describe two types of quaternionic neural network models. One type is a multilayer perceptron based on 3D geometrical affine transformations by quaternions. The operations that can be performed in this network are translation, dilatation, and spatial rotation in three-dimensional space. Several examples are provided in order to demonstrate the utility of this network. The other type is a Hopfield-type recurrent network whose parameters are directly encoded into quaternions. The stability of this network is demonstrated by proving that the energy decreases monotonically with respect to the change in neuron states. The fundamental properties of this network are presented through the network with three neurons.

scholarly journals A Fractional-Order Discrete Noninvertible Map of Cubic Type: Dynamics, Control, and Synchronization

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-21
Author(s):  
Xiaojun Liu ◽  
Ling Hong ◽  
Lixin Yang ◽  
Dafeng Tang
Keyword(s):  
Fractional Order ◽  
Initial Conditions ◽  
Dimensional Space ◽  
Equilibrium Points ◽  
Three Dimensional ◽  
State Variables ◽  
Discrete Maps ◽  
The Stability ◽  
Control And Synchronization ◽  
Simultaneous Variation

In this paper, a new fractional-order discrete noninvertible map of cubic type is presented. Firstly, the stability of the equilibrium points for the map is examined. Secondly, the dynamics of the map with two different initial conditions is studied by numerical simulation when a parameter or a derivative order is varied. A series of attractors are displayed in various forms of periodic and chaotic ones. Furthermore, bifurcations with the simultaneous variation of both a parameter and the order are also analyzed in the three-dimensional space. Interior crises are found in the map as a parameter or an order varies. Thirdly, based on the stability theory of fractional-order discrete maps, a stabilization controller is proposed to control the chaos of the map and the asymptotic convergence of the state variables is determined. Finally, the synchronization between the proposed map and a fractional-order discrete Loren map is investigated. Numerical simulations are used to verify the effectiveness of the designed synchronization controllers.

A Geometrical treatment of the Correspondence between Lines in Threefold Space and Points of a Quadric in Fivefold space

1925 ◽  
Vol 22 (5) ◽  
pp. 694-699 ◽  
Author(s):  
H. W. Turnbull
Keyword(s):  
Dimensional Space ◽  
Three Dimensional ◽  
Quadratic Relation ◽  
Four Dimensions ◽  
Homogeneous Coordinates ◽  
Plücker Coordinates ◽  
Straight Line ◽  
Set Up ◽  
Image Position ◽  
Three Dimensional Space

§ 1. The six Plücker coordinates of a straight line in three dimensional space satisfy an identical quadratic relationwhich immediately shows that a one-one correspondence may be set up between lines in three dimensional space, λ, and points on a quadric manifold of four dimensions in five dimensional space, S5. For these six numbers pij may be considered to be six homogeneous coordinates of such a point.

Cubic Hybrid Mechanism Based on S[T] Output Base and P/R Input Base

2012 ◽  
Vol 430-432 ◽  
pp. 1725-1728
Author(s):  
Jian Guo Luo ◽  
Mao Yan He
Keyword(s):  
Parallel Mechanism ◽  
Dimensional Space ◽  
Three Dimensional ◽  
One Dimensional ◽  
Hybrid Mechanism ◽  
Hybrid Manipulator ◽  
New Type ◽  
The Stability ◽  
Serial Mechanism ◽  
Three Dimensional Space

Based on the flexibility of single couple of serial mechanism and the stability of multi couples of parallel mechanism, a new type of S[T] output base of hybrid mechanism presented, component of sphere joint run through the tiger joint, this component still the output one with the capability of rotate in three dimensional space. Add serial branch including three translation couple P or/and rotation couple R to the new type of S[T] output base, put these members on one cubic frame, twenty seven configurations obtained with 3-DOF(degree of freedom) allow of three dimensional rotation, twenty seven configurations belong to three conditions obtained with 4-DOF allow of three dimensional rotation and one dimensional translation, nine configurations belong to three conditions obtained with 5-DOF allow of three dimensional rotation and two dimensional translation, one configuration obtained with 6-DOF allow of three dimensional rotation and three dimensional translation, all those sixty four configurations have no more than six translation couple or rotation couple, and the sum of two kind of couple is equal to six. Developing new type of hybrid manipulator based on the hybrid cubic mechanism constructed with S[T] output base and P/R input base will be possible in theory and useful.

Queueing in space

1994 ◽  
Vol 26 (04) ◽  
pp. 1095-1116 ◽  
Author(s):  
Eitan Altman ◽  
Hanoch Levy
Keyword(s):  
Convex Space ◽  
Dimensional Space ◽  
Three Dimensional ◽  
Finite Size ◽  
System Stability ◽  
Single Server ◽  
Greedy Method ◽  
Service Policies ◽  
The Stability ◽  
Greedy Policy

We consider a problem in which a single server must serve a stream of customers whose arrivals are distributed over a finite-size convex space. Under the assumption that the server has full information on the customer location, obvious service policies are the FCFS and the greedy (serve-the-closest-customer) approaches. These algorithms are, however, either inefficient (FCFS) or ‘unfair' (greedy). We propose and study two alternative algorithms, the gated-greedy policy and the gated-scan policy, which are more ‘fair' than the pure greedy method. We show that the stability conditions of the gated-greedy are p < 1 (where p is the expected rate at which work arrives at the system), implying that the method is at least as efficient (in terms of system stability) as any other discipline, in particular the greedy one. For the gated-scan policy we show that for any p < 1 one can design a stable gated-scan policy; however, for any fixed gated-scan policy there exists p < 1 for which the policy is unstable. We evaluate the performance of the gated-scan policy, and present bounds for the performance of the gated-greedy policy. These results are derived for systems in which the arrivals occur on a two-dimensional space (a square) but they are not limited to this configuration; rather they hold for more complex N-dimensional spaces, in particular for serving customers in (three-dimensional) convex space and serving customers on a line.

scholarly journals ANY FIVE POINTS LIE IN A 3-SPACE

2020 ◽  
Author(s):  
Zh. Nikoghosyan ◽  
Keyword(s):  
Dimensional Space ◽  
Three Dimensional ◽  
Entire Space ◽  
Unique Line ◽  
Straight Line ◽  
Set Of Points ◽  
Three Dimensional Space

In axiomatic formulations, every two points lie in a (straight) line, every three points lie in a plane and every four points lie in a three-dimensional space (3-space). In this paper we show that every five points lie in a 3-space as well, implying that every set of points lie in a 3-space. In other words, the 3-space occupies the entire space. The proof is based on the following four axioms: 1) every two distinct points define a unique line, 2) every three distinct points, not lying on the line, define a unique plane, 3) if 𝐴 and 𝐵 are two distinct points in a 3-space, then the line defined by the points 𝐴, 𝐵, entirely lies in this 3-space, 4) if 𝐹1, 𝐹2, 𝐹3 are three distinct points in a 3-space, not lying in a line, then the plane defined by the points 𝐹1, 𝐹2, 𝐹3, lies entirely in this 3-space.

scholarly journals Quantum Bose-Fermi droplets

2019 ◽  
Vol 6 (6) ◽  
Author(s):  
Debraj Rakshit ◽  
Tomasz Karpiuk ◽  
Miroslaw Brewczyk ◽  
Mariusz Gajda
Keyword(s):  
Dimensional Space ◽  
Mean Field ◽  
Three Dimensional ◽  
Field Energy ◽  
Liquid Droplets ◽  
Spin Polarized ◽  
The Stability ◽  
Three Body ◽  
Higher Order Corrections ◽  
Three Dimensional Space

We study the stability of a zero temperature mixture of attractively interacting degenerate bosons and spin-polarized fermions in the absence of confinement. We demonstrate that higher order corrections to the standard mean-field energy can lead to a formation of Bose-Fermi liquid droplets – self-bound systems in three-dimensional space. The stability analysis of the homogeneous case is supported by numerical simulations of finite systems by explicit inclusion of surface effects. We discuss the experimental feasibility of formation of quantum droplets and indicate the main obstacle – inelastic three-body collisions.

scholarly journals On the modeling of planetary plasma environments by a fully kinetic electromagnetic global model HYB-em

2010 ◽  
Vol 28 (3) ◽  
pp. 743-751 ◽  
Author(s):  
V. Pohjola ◽  
E. Kallio
Keyword(s):  
Magnetic Field ◽  
Kinetic Model ◽  
Electromagnetic Waves ◽  
Dimensional Space ◽  
Spherical Wave ◽  
Three Dimensional ◽  
Magnetized Plasma ◽  
Electromagnetic Model ◽  
The Stability ◽  
Propagation Of Waves

Abstract. We have developed a fully kinetic electromagnetic model to study instabilities and waves in planetary plasma environments. In the particle-in-a-cell (PIC) model both ions and electrons are modeled as particles. An important feature of the developed global kinetic model, called HYB-em, compared to other electromagnetic codes is that it is built up on an earlier quasi-neutral hybrid simulation platform called HYB and that it can be used in conjunction with earlier hybrid models. The HYB models have been used during the past ten years to study globally the flowing plasma interaction with various Solar System objects: Mercury, Venus, the Moon, Mars, Saturnian moon Titan and asteroids. The new stand-alone fully kinetic model enables us to (1) study the stability of various planetary plasma regions in three-dimensional space, (2) analyze the propagation of waves in a plasma environment derived from the other global HYB models. All particle processes in a multi-ion plasma which are implemented on the HYB platform (e.g. ion-neutral-collisions, chemical processes, particle loss and production processes) are also automatically included in HYB-em model. In this brief report we study the developed approach by analyzing the propagation of high frequency electromagnetic waves in non-magnetized plasma in two cases: We study (1) expansion of a spherical wave generated from a point source and (2) propagation of a plane wave in plasma. The analysis shows that the HYB-em model is capable of describing these space plasma situations successfully. The analysis also suggests the potential of the developed model to study both high density-high magnetic field plasma environments, such as Mercury, and low density-low magnetic field plasma environments, such as Venus and Mars.

scholarly journals Design and Implementation of a 3-Dimensional Attitudes Estimator Device using Low Cost Accelerometer & Gyroscope with Microcontroller IDE

2020 ◽  
Vol 12 (2) ◽  
pp. 151-161
Author(s):  
M. RAJA ◽  
Ugur GUVEN ◽  
Kartikay SINGH
Keyword(s):  
Dimensional Space ◽  
Low Cost ◽  
Three Dimensional ◽  
3 Dimensional ◽  
Aerospace Applications ◽  
Vector Quantity ◽  
Measurement Units ◽  
Fixed Axis ◽  
The Stability ◽  
Three Dimensional Space

Navigation and guidance systems for most automobile as well as aerospace applications require a coupled chip setup known as Inertial Measurement Units (IMU) which, depending on the degree of freedoms, contains a Gyroscope (for maintaining orientation and angular velocity), Accelerometers (to determine acceleration in the respective direction) and a Magnetometer (to determine the respective magnetic fields). In the three-dimensional space, any required rotation analysis is limited to the coordinate systems and all subtended angles in either direction must be defined by a fixed axis to effectively estimate the stability and to define all the attitude estimates needed to compile different rotations and orientations. The Quaternions are mathematical notations used for defining rotations and orientation in three-dimensional space. The simplest terms Quaternions are impossible to visualize in a three-dimensional space; the first three terms will be identical to the coordinate system, but through Quaternions another vector quantity is added into the equations, which may in fact underline how we can account for all rotational quantities. The fundamental analysis of these components different applications for various fields is proposed.

Fast and accurate collision detection based on enclosed ellipsoid

Robotica ◽  
2001 ◽  
Vol 19 (4) ◽  
pp. 381-394 ◽  
Author(s):  
Ming-Yi Ju ◽  
Ming-Yi Ju ◽  
Jing-Sin Liu ◽  
Shen-Po Shiang ◽  
Yuh-Ren Chien ◽  
...  
Keyword(s):  
Collision Detection ◽  
Object Representation ◽  
Dimensional Space ◽  
Three Dimensional ◽  
Accurate Method ◽  
Convex Polyhedra ◽  
Graphical Simulation ◽  
Bounding Volume ◽  
Straight Line ◽  
Multiple Robot

A fast and accurate method for detecting the collisions of convex polyhedra in a graphical simulation environment based on a newly developed method of distance estimate is presented. By the simultaneous use of the enclosing and the enclosed ellipsoids of convex polyhedra, potential collisions can be detected more accurate than those methods using only bounding volume for object representation, and more efficient than the polyhedral methods. An approach for computing the enclosed ellipsoid of a convex polyhedron by compressing, stretching and scaling operations on its best-fit enclosing ellipsoid is introduced. Graphical simulations of two case studies (moving polyhedral objects in three-dimensional space and multiple robot arms undergoing straight line motions) are conducted to demonstrate the accuracy of the proposed algorithm for collision detection.

Sign in / Sign up

Export Citation Format

Share Document