Related papers: Two Non-Congruent Regular Polygons Having Vertices…
We prove that for some potentials (including the Newtonian one, and the potential of Helmholtz vortices in the plane) relative equilibria consisting of two homothetic regular polygons of arbitrary size can only occur if the masses at each…
We describe an algorithm for computing the separating common tangents of two simple polygons using linear time and only constant workspace. A tangent of a polygon is a line touching the polygon such that all of the polygon lies to the same…
Based on the parallelogram law and isosceles orthogonality, we define a new orthogonal geometric constant. We first discuss some basic properties of this new constant. Next, we consider the relation between the constant and the uniformly…
We provide a remarkably simple algorithm to compute all (at most four) common tangents of two disjoint simple polygons. Given each polygon as a read-only array of its corners in cyclic order, the algorithm runs in linear time and constant…
The deviation of a general convex body with twice differentiable boundary and an arbitrarily positioned polytope with a given number of vertices is studied. The paper considers the case where the deviation is measured in terms of the…
We seek for lines of minimal distance to finitely many points in the plane. The distance between a line and a set of points is defined by the L^p-norm, 1\leq p\leq \infty, of the vector of vertical or orthogonal distances from the single…
Let $ l =[l_0,l_1]$ be the directed line segment from $l_0\in {\mathbb R}^n$ to $l_1\in{\mathbb R}^n.$ Suppose $\bar l=[\bar l_0,\bar l_1]$ is a second segment of equal length such that $l, \bar l$ satisfy the "two sticks condition": $\|…
Place the vertices of a rectangle at $\{(0, \pm 1/2), (a, \pm 1/2)\}$, where $a$ is rational. We show that if $v_3(a) = 0$, then any point $(x,y)$ that is rational distance from all four vertices of the rectangle has either $v_3(x) < 0$ or…
We study criteria attesting that a given graph can not be embedded in the plane so that neighboring vertices are at unit distance apart and the straight line edges do not cross.
The measurement of distance between two objects is generalized to the case where the objects are no longer points but are one-dimensional. Additional concepts such as non-extensibility, curvature constraints, and non-crossing become central…
We study the generalized analogues of conics for normed planes by using the following natural approach: It is well known that there are different metrical definitions of conics in the Euclidean plane. We investigate how these definitions…
Let $K$ be a convex pentagon in the plane and let $K_1$ be the pentagon bounded by the diagonals of $K$. It has been conjectured that the maximum of the ratio between the areas of $K_1$ and $K$ is reached when $K$ is an affine regular…
If $S$ is a given regular $d$-simplex of edge length $a$ in the $d$-dimensional Euclidean space $\mathcal{E}$, then the distances $t_1$, $\cdots$, $t_{d+1}$ of an arbitrary point in $\mathcal{E}$ to the vertices of $S$ are related by the…
We discuss and compare several geometric structures which imply an upper bound to the acceleration of a particle measured in its rest system. While all of them have the same implications on the motion of a point particle, they differ in…
Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether the problem is in P or NP-complete. We prove that two…
Consider a convex polygon P in the plane, and denote by U a homothetical copy of the vector sum of P and (-P). Then the polygon U, as unit ball, induces a norm such that, with respect to this norm, P has constant Minkowskian width. We…
We construct a series of examples of non--flat non--homogeneous parabolic geometries that carry a symmetry of the parabolic geometry at each point.
This paper analyses non-regular $|2|$-graded geometries, and show that they share many of the properties of regular geometries -- the existence of a unique normal Cartan connection encoding the structure, the harmonic curvature as…
It is well known that to determine a triangle up to congruence requires three measurements: three sides, two sides and the included angle, or one side and two angles. We consider various generalizations of this fact to two and three…
We revisit a new type of a Voronoi diagram, in which distance is measured from a point to a pair of points. We consider a few more such distance functions, based on geometric primitives, and analyze the structure and complexity of the…