English
Related papers

Related papers: Distances between realizations of order types

200 papers

We consider the directed Hausdorff distance between point sets in the plane, where one or both point sets consist of imprecise points. An imprecise point is modelled by a disc given by its centre and a radius. The actual position of an…

Computational Geometry · Computer Science 2009-09-30 Christian Knauer , Maarten Löffler , Marc Scherfenberg , Thomas Wolle

By a compact packing of the plane by discs, $P$, we mean a collection of closed discs in the plane with pairwise disjoint interior so that, for every disc $C\in P$, there exists a sequence of discs $D_{0},\ldots,D_{m-1}\in P$ so that each…

Metric Geometry · Mathematics 2023-05-02 Miek Messerschmidt

It is shown that a separated sequence of points in the unit disc of the complex plane is in fact uniformly separated, if there exists a certain intermediate sequence whose separated subsequences are uniformly separated. This property is…

Classical Analysis and ODEs · Mathematics 2018-10-01 Janne Gröhn , Artur Nicolau

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

Number Theory · Mathematics 2007-05-23 D. A. Goldston , J. Pintz , C. Y. Yildirim

The geodesic between two points $a$ and $b$ in the interior of a simple polygon~$P$ is the shortest polygonal path inside $P$ that connects $a$ to $b$. It is thus the natural generalization of straight line segments on unconstrained point…

Computational Geometry · Computer Science 2017-08-22 Oswin Aichholzer , Matias Korman , Alexander Pilz , Birgit Vogtenhuber

Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…

Combinatorics · Mathematics 2010-10-12 George B. Purdy , Justin W. Smith

In Euclidean space there is a trivial upper bound on the maximum length of a compound "walk" built up of variable-length jumps, and a considerably less trivial lower bound on its minimum length. The existence of this non-trivial lower bound…

Mathematical Physics · Physics 2013-09-19 Petarpa Boonserm , Matt Visser

In this note, we show that in planar pointsets determining many unit distances, these unit distances must span many directions. Specifically, we show that a set of $n$ points can determine only $o(n^{4/3})$ unit distances from a set of at…

Combinatorics · Mathematics 2025-04-08 Gabriel Currier , József Solymosi

Let $P$ be a collection of $n$ points in the plane, each moving along some straight line at unit speed. We obtain an almost tight upper bound of $O(n^{2+\epsilon})$, for any $\epsilon>0$, on the maximum number of discrete changes that the…

Computational Geometry · Computer Science 2013-12-10 Natan Rubin

Let $\{p_1,\dots,p_n\}$ and $\{q_1,\dots,q_n\}$ be two sets of $n$ labeled points in general position in the plane. We say that these two point sets have the same order type if for every triple of indices $(i,j,k)$, $p_k$ is above the…

Using the Semple bundle construction, we derive an intersection-theoretic formula for the number of simultaneous contacts of specified orders between members of a generic family of degree $d$ plane curves and finitely many fixed curves. The…

alg-geom · Mathematics 2008-02-03 Susan Jane Colley , Gary Kennedy

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…

Computational Geometry · Computer Science 2012-05-14 Anna Lubiw , Vinayak Pathak

Given a set of N points, we have discovered an algorithm that can separate these points from one another by n-dimensional planes. Each point is chosen at random and put into a set S and planes which separate them are determined and put into…

Computational Geometry · Computer Science 2015-10-26 K. Eswaran

In this paper we discuss the relationship between the moving planes of a rational parametric surface and the singular points on it. Firstly, the intersection multiplicity of several planar curves is introduced. Then we derive an equivalent…

Numerical Analysis · Mathematics 2010-01-14 Falai Chen , Xuhui Wang

In this paper, we are interested to study the stability of the ascent of a mutually commuting n-tuple T submitted to a perturbation by an n-tuple S which commutes mutually with T. This study lead us to generalize some well known results for…

Functional Analysis · Mathematics 2020-06-09 Boulbeba Abdelmoumen , Hafedh Dammak , Sonia Yengui

We consider the number of distinct distances between two finite sets of points in ${\bf R}^k$, for any constant dimension $k\ge 2$, where one set $P_1$ consists of $n$ points on a line $l$, and the other set $P_2$ consists of $m$ arbitrary…

Combinatorics · Mathematics 2016-12-16 Ariel Bruner , Micha Sharir

We prove that if $P$ is a set of $n$ points in $\mathbb{C}^2$, then either the points in $P$ determine $\Omega(n^{1-\epsilon})$ complex distances, or $P$ is contained in a line with slope $\pm i$. If the latter occurs then each pair of…

Combinatorics · Mathematics 2023-08-24 Adam Sheffer , Joshua Zahl

Given $n$ continuous open curves in the plane, we say that a pair is touching if they have only one interior point in common and at this point the first curve does not get from one side of the second curve to its other side. Otherwise, if…

Combinatorics · Mathematics 2017-08-31 Janos Pach , Geza Toth

In this paper, we prove than given two cubic knots $K_1$, $K_2$ in $\mathbb{R}^3$, they are isotopic if and only if one can pass from one to the other by a finite sequence of cubulated moves. These moves are analogous to the Reidemeister…

Geometric Topology · Mathematics 2013-07-30 Gabriela Hinojosa , Alberto Verjosvky , Cynthia Verjovsky Marcotte

For the given regular plane polygon and an arbitrary point in the plane of the polygon, the distances from the point to the vertices of the polygon are defined. We proved that there is one more non-congruent regular polygon having the…

General Mathematics · Mathematics 2022-02-01 Mamuka Meskhishvili