Related papers: Capturing points with a rotating polygon (and a 3D…
In this paper, the intuitive idea of tilt is formalised into the rigorous concept of tilt rotations. This is motivated by the high relevance that pure tilt rotations have in the analysis of balancing bodies in 3D, and their applicability to…
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
Representing a polygon using a set of simple shapes has numerous applications in different use-case scenarios. We consider the problem of covering the interior of a rectilinear polygon with holes by a set of area-weighted, axis-aligned…
We study the two-dimensional geometric knapsack problem for convex polygons. Given a set of weighted convex polygons and a square knapsack, the goal is to select the most profitable subset of the given polygons that fits non-overlappingly…
A new simple geometrical interpretation of complex numbers is presented. It differs from their usual interpretation as points in the complex plane. From the new point of view the complex numbers are rather operations on vectors than points.…
An algorithm to compute the six distances between particles of a planar Four-Body central configuration is presented according to the following schema. An orthocentric tetrahedron is computed as a function of given masses. Each mass is…
We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason - the problem of "super…
We consider the covering of a ball in certain normed spaces by its congruent subsets and show that if the finite number of sets is not greater than the dimensionality of the space, then the centre of the ball either belongs to the interior…
We study the problem of moving a vertex in an unstructured mesh of triangular, quadrilateral, or tetrahedral elements to optimize the shapes of adjacent elements. We show that many such problems can be solved in linear time using…
Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…
It is well known that a rigid motion of the Euclidean plane can be written as the composition of at most three reflections. It is perhaps not so widely known that a similar result holds for Euclidean space in any number of dimensions. The…
In this paper we present some new, practical, geometric optimization techniques for computing polygon partitions, 1D and 2D point, interval, square and rectangle covers, as well as 1D and 2D interval and rectangle K-centers. All the…
We consider extending the visibility polygon of a given point $q$, inside a simple polygon $P$ by converting some edges of $P$ to mirrors. We will show that several variations of the problem of finding mirror-edges to add precisely $k$…
In this series of eight papers we present the applications of methods from wavelet analysis to polynomial approximations for a number of accelerator physics problems. In this part we consider orbital motion in transverse plane for a single…
This paper presents an experimental study on the application of quaternions in several machine learning algorithms. Quaternion is a mathematical representation of rotation in three-dimensional space, which can be used to represent complex…
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…
We present the algorithm for generating strictly saturated random sequential adsorption packings built of rounded polygons. It can be used to study various properties of such packings built of a wide variety of different shapes and in…
Motivated by a question in origami, we consider sets of points in the complex plane constructed in the following way. Let $L_\alpha(p)$ be the line in the complex plane through $p$ with angle $\alpha$ (with respect to the real axis). Given…
An interesting description of a collinear configuration of four particles is found in terms of two spherical coordinates. An algorithm to compute the four coordinates of particles of a collinear Four-Body central configuration is presented…
The input to the distant representatives problem is a set of $n$ objects in the plane and the goal is to find a representative point from each object while maximizing the distance between the closest pair of points. When the objects are…