Related papers: A comprehensive analysis of the Snellius-Pothenot …

The article proposes a new method for finding the triangle-triangle intersection in 3D space, based on the use of computer graphics algorithms -- cutting off segments on the plane when moving and rotating the beginning of the coordinate…

Consider an irreducible bilinear form $f(x_1,x_2;y_1,y_2)$ with integer coefficients. We derive an upper bound for the number of integer points $(\mathbf{x},\mathbf{y})\in\mathbb{P}^1\times\mathbb{P}^1$ inside a box satisfying the equation…

For the Newtonian 4-body problem in space we prove that any zero angular momentum bounded solution suffers infinitely many coplanar instants, that is, times at which all 4 bodies lie in the same plane. This result generalizes a known result…

In 2011 at an Oberwolfach workshop in Discrete Geometry, V. Dol'nikov posed the following problem. Consider three non-empty families of translates of a convex compact set $K$ in the plane. Suppose that every two translates from different…

The Orbit Problem asks whether the orbit of a point under a matrix reaches a given target set. When the target is a single point, the problem was shown to be decidable in polynomial time by Kannan and Lipton. This decidability result was…

In this paper we study one of the fundamental predicates required for the construction of the 3D Apollonius diagram (also known as the 3D Additively Weighted Voronoi diagram), namely the EdgeConflict predicate: given five sites $S_i,…

We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…

We consider the problem of optimizing the product of the distances from a given point in a triangle to each vertex. There are two possible cases in general. For isosceles triangles, we explicitly show exactly when both cases occur.

Let U denote the open subset formed by deleting the unique line from the singular cubic surface x_1x_2^2+x_2x_0^2+x_3^3=0. In this paper an asymptotic formula is obtained for the number of rational points on U of bounded height, which…

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

The dimension of the visible part of self-affine sets, that satisfy domination and a projection condition, is being studied. The main result is that the assouad dimension of the visible part equals to 1 for all directions outside the set of…

Periodic orbits (POs) play a central role in the circular restricted three-body problem (CRTBP). This paper introduces a method to search for POs by identifying single- and multiple-revolution fixed points in chosen Poincare maps that…

We obtain an analytical solution for the weighted Fermat-Torricelli problem for an equilateral geodesic triangle A_1A_2A_3 which is composed by three equal geodesic arcs (sides) of length Pi/2 for given three positive unequal weights that…

The first goal of this paper is to prove a sharp condition to guarantee of having a positive proportion of all congruence classes of triangles in given sets in $\mathbb{F}_q^2$. More precisely, for $A, B, C\subset \mathbb{F}_q^2$, if…

In this paper we explicitly estimate the number of points in a subset $A \subset \R^{d}$ as a function of the maximum angle $\angle A$ that any three of these points form, provided $\angle A < \theta_d := \arccos(-\frac 1 {d}) \in…

Let $S$ be a $k$-colored (finite) set of $n$ points in $\mathbb{R}^d$, $d\geq 3$, in general position, that is, no {$(d + 1)$} points of $S$ lie in a common $(d - 1)$}-dimensional hyperplane. We count the number of empty monochromatic…

In this paper we propose some approaches for finding of pointwise estimates of a solution of the Dirichlet boundary value problem $-\Delta u \pm |u|^{q-1} u = 0 $, $|u|=k$ when $|x|=d<1$ and $|u|=0$ when $|x|=1$ where $x\in \Omega = \{x|…

In this paper we show that the number of distinct distances determined by a set of $n$ points on a constant-degree two-dimensional algebraic variety $V$ (i.e., a surface) in $\mathbb R^3$ is at least $\Omega\left(n^{7/9}/{\rm polylog}…

It is well known that the P3P problem could have 1, 2, 3 and at most 4 positive solutions under different configurations among its 3 control points and the position of the optical center. Since in any real applications, the knowledge on the…

We study the problem of covering a given point set in the plane by unit disks so that each point is covered exactly once. We prove that 17 points can always be exactly covered. On the other hand, we construct a set of 657 points where an…