Related papers: Fitting lines to points in the plane

This article gives an introduction to optimal transport, a mathematical theory that makes it possible to measure distances between functions (or distances between more general objects), to interpolate between objects or to enforce…

The general expression of the angular distance between two point sources as measured by an arbitrary observer is given. The modelling presented here is rigorous, covariant and valid in any space-time. The sources of light may be located at…

We define sequence patterns of length $n$ and level $\ell$ to be equivalence classes of sequences that have $n$ elements from the set of $\ell$ integer symbols $\{1,2,\ldots,\ell\}$ with no restriction on repetition, where the equivalence…

It is widely believed that point sets in the plane which determine few distinct distances must have some special structure. In particular, such sets are believed to be similar to a lattice. This note considers two different ways to quantify…

Given S_1, a finite set of points in the plane, we define a sequence of point sets S_i as follows: With S_i already determined, let L_i be the set of all the line segments connecting pairs of points of the union of S_1,...,S_i, and let…

The completeness on the boundary (in the sense of Picone) of certain systems related to the III and IV BVPs for the elasticity system is proved. The completeness is obtained in both $L^p$ ($1\leq 1<\infty$) and uniform norms.

Let $S$ be a finite set of points in the plane and let $\mathcal{T}(S)$ be the set of intersection points between pairs of lines passing through any two points in $S$. We characterize all configurations of points $S$ such that iteration of…

Optimal transportation distances are valuable for comparing and analyzing probability distributions, but larger-scale computational techniques for the theoretically favorable quadratic case are limited to smooth domains or regularized…

Guth and Katz proved that any point set $\mathcal P$ in the plane determines $\Omega(|\mathcal P|/\log|\mathcal P|)$ distinct distances. We show that when near to this lower bound, a point set $\mathcal P$ of the form $A\times A$ must…

We are given the adjacency matrix of a geometric graph and the task of recovering the latent positions. We study one of the most popular approaches which consists in using the graph distances and derive error bounds under various…

In this work, we carry out structural and algorithmic studies of a problem of barrier forming: selecting theminimum number of straight line segments (barriers) that separate several sets of mutually disjoint objects in the plane. The…

Let $L$ be a set of $n$ lines in the plane, not necessarily in general position. We present an efficient algorithm for finding all the vertices of the arrangement $A(L)$ of maximum level, where the level of a vertex $v$ is the number of…

Let $G$ be a connected graph. The average distance of a vertex $v$ of $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity and remoteness of $G$ are defined as the minimum and maximum,…

Given a polygon $P$ in the plane that can be translated, rotated and enlarged arbitrarily inside a unit square, the goal is to find a set of lines such that at least one of them always hits $P$ and the number of lines is minimized. We prove…

Given a convex set and an interior point close to the boundary, we prove the existence of a supporting hyperplane whose distance to the point is controlled, in a dimensionally quantified way, by the thickness of the convex set in the…

A large family of linear codes with flexible parameters from almost bent functions and perfect nonlinear functions are constructed and their parameters are determined. Some constructed linear codes and their related codes are optimal in the…

The least squares fit to a straight line, when both variables are affected by all equal uncorrelated errors, leads to very simple results for both the estimated parameters and their standard errors, of widespread applicability. In this…

We prove fixed point theorems in a space with a distance function that takes values in a partially ordered monoid. On the one hand, such an approach allows one to generalize some fixed point theorems in a broad class of spaces, including…

We establish improved finite field Szemeredi-Trotter and Beck type theorems. First we show that if P and L are a set of points and lines respectively in the plane F_p^2, with |P|,|L| \leq N and N<p, then there are at most C_1…

Let $P$ be a set of $n$ points in the real plane contained in an algebraic curve $C$ of degree $d$. We prove that the number of distinct distances determined by $P$ is at least $c_d n^{4/3}$, unless $C$ contains a line or a circle. We also…