Separability of pairs of polygons through single translations

Robotica ◽  
1987 ◽  
Vol 5 (1) ◽  
pp. 55-63 ◽  
Author(s):  
Jörg-Rüdiger Sack ◽  
Godfried T. Toussaint

SUMMARYLet P = {p1, …,pn} and Q = {q1,…,qm} be two simple polygons in the plane with non-intersecting interiors, the vertices of which are specified by their cartesian coordinates in order. The translation separability query asks whether there exists a direction in which P can be translated by an arbitrary distance without colliding with Q. It is shown that all directions that admit such a motion can be computed in O(nlogm) time, where n > m, thus improving the previous complexity of O(nm) established for this problem. In designing this algorithm a polygon partitioning technique is introduced that may find application in other geometric problems.The algorithm presented in this paper solves a simplified version of the grasping problem in robotics. Given a description of a robot hand and a set of objects to be manipulated, the robot must determine which objects can be grasped. The solution given here assumes a two-dimensional world, a hand without an arm, and grasping under translation only.

Open Physics ◽  
2009 ◽  
Vol 7 (4) ◽  
Author(s):  
Nuri Ünal

AbstractIn this study, we construct the coherent states for a particle in the Smorodinsky-Winternitz potentials, which are the generalizations of the two-dimensional harmonic oscillator problem. In the first case, we find the non-spreading wave packets by transforming the system into four oscillators in Cartesian, and also polar, coordinates. In the second case, the coherent states are constructed in Cartesian coordinates by transforming the system into three non-isotropic harmonic oscillators. All of these states evolve in physical-time. We also show that in parametric-time, the second case can be transformed to the first one with vanishing eigenvalues.


2017 ◽  
Vol 815 ◽  
pp. 77-116 ◽  
Author(s):  
S. Viroulet ◽  
J. L. Baker ◽  
A. N. Edwards ◽  
C. G. Johnson ◽  
C. Gjaltema ◽  
...  

Geophysical granular flows, such as avalanches, debris flows, lahars and pyroclastic flows, are always strongly influenced by the basal topography that they flow over. In particular, localised bumps or obstacles can generate rapid changes in the flow thickness and velocity, or shock waves, which dissipate significant amounts of energy. Understanding how a granular material is affected by the underlying topography is therefore crucial for hazard mitigation purposes, for example to improve the design of deflecting or catching dams for snow avalanches. Moreover, the interactions with solid boundaries can also have important applications in industrial processes. In this paper, small-scale experiments are performed to investigate the flow of a granular avalanche over a two-dimensional smooth symmetrical bump. The experiments show that, depending on the initial conditions, two different steady-state regimes can be observed: either the formation of a detached jet downstream of the bump, or a shock upstream of it. The transition between the two cases can be controlled by adding varying amounts of erodible particles in front of the obstacle. A depth-averaged terrain-following avalanche theory that is formulated in curvilinear coordinates is used to model the system. The results show good agreement with the experiments for both regimes. For the case of a shock, time-dependent numerical simulations of the full system show the evolution to the equilibrium state, as well as the deposition of particles upstream of the bump when the inflow ceases. The terrain-following theory is compared to a standard depth-averaged avalanche model in an aligned Cartesian coordinate system. For this very sensitive problem, it is shown that the steady-shock regime is captured significantly better by the terrain-following avalanche model, and that the standard theory is unable to predict the take-off point of the jet. To retain the practical simplicity of using Cartesian coordinates, but have the improved predictive power of the terrain-following model, a coordinate mapping is used to transform the terrain-following equations from curvilinear to Cartesian coordinates. The terrain-following model, in Cartesian coordinates, makes identical predictions to the original curvilinear formulation, but is much simpler to implement.


Computing ◽  
1983 ◽  
Vol 31 (3) ◽  
pp. 191-202 ◽  
Author(s):  
H. ElGindy ◽  
D. Avis ◽  
G. Toussaint

Author(s):  
Frédéric Dubas ◽  
Kamel Boughrara

The most significant assumptions in the subdomain technique (i.e., based on the formal resolution of Maxwell's equations applied in subdomain) is defined by: “The iron parts (i.e., the teeth and the back-iron) are considered to be infinitely permeable so that the saturation effect is neglected”. In this paper, the author presents a new scientific contribution on improving of this method in two-dimensional (2-D) and in Cartesian coordinates by focusing on the consideration of iron. The subdomains connection is carried out in the two directions (i.e., x- and y-edges). The improvement was performed by solving magnetostatic Maxwell's equations for an air- or iron-core coil supplied by a direct current. To evaluate the efficacy of the proposed technique, the magnetic flux density distributions have been compared with those obtained by the 2-D finite-element analysis (FEA). The semi-analytical results are in quite satisfying agreement with those obtained by the 2-D FEA, considering both amplitude and waveform.


1993 ◽  
Vol 03 (04) ◽  
pp. 443-462 ◽  
Author(s):  
MIKHAIL J. ATALLAH ◽  
PAUL B. CALLAHAN ◽  
MICHAEL T. GOODRICH

In this paper we show that it is impossible to solve a number of “natural” two-dimensional geometric problems in polylog time with a polynomial number of processors (unless P=NC). Thus, we disprove a popular belief that there are no natural P-complete geometric problems in the plane. The problems we address include instances of polygon triangulation, planar partitioning, and geometric layering. Our results are based on non-trivial reductions from the monotone circuit value and planar circuit value problems.


Sign in / Sign up

Export Citation Format

Share Document