相关论文: Some Open Problems Regarding the Number of Lines a…

A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…

We explore the separability of point sets in the plane by a restricted-orientation convex hull, which is an orientation-dependent, possibly disconnected, and non-convex enclosing shape that generalizes the convex hull. Let $R$ and $B$ be…

In this paper we discuss, from a historical and philosophical point of view, a variation of the meaning of the five postulates in Euclidean Geometry and we make a short reference to D. Hilberts formalism. We examine, throughout the ages,…

Fix two points $p$ and $q$ in the plane and a positive number $k \neq 1$. A result credited to Apollonius of Perga states that the set of points $x$ that satisfy $d(x, p)/d(x, q) = k$ forms a circle. In this paper we study the analogous set…

This paper introduces advances in the geometry of the transforms for cross ratio of four points in a line in the Desargues affine plane. The results given here have a clean, based Desargues affine plan axiomatic and definitions of addition…

The information technology explosion has dramatically increased the application of new mathematical ideas and has led to an increasing use of mathematics across a wide range of fields that have been traditionally labeled "pure" or…

Let $S$ be a set of $n$ points in general position in the plane. Join every pair of points in $S$ with a straight line segment. Let $\overline{cr}(S)$ be number of pairs of these edges that intersect in their interior. Suppose that this…

Let $P$ be a set of $n$ points in the plane that determines at most $n/5$ distinct distances. We show that no line can contain more than $O(n^{43/52}{\rm polylog}(n))$ points of $P$. We also show a similar result for rectangular distances,…

For k >= 3, a k-angulation is a 2-connected plane graph in which every internal face is a k-gon. We say that a point set P admits a plane graph G if there is a straight-line drawing of G that maps V(G) onto P and has the same facial cycles…

We study a family of variants of Erd\H os' unit distance problem, concerning distances and dot products between pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, we look for…

We study the problem of crescent configurations, posed by Erd\H{o}s in 1989. A crescent configuration is a set of $n$ points in the plane such that: 1) no three points lie on a common line, 2) no four points lie on a common circle, 3) for…

In this paper we introduce point-ellipse configurations and point-conic configurations. We study some of their basic properties and describe two interesting families of balanced point-ellipse, respectively point-conic $6$-configurations.…

A graph drawn in the plane with straight-line edges is called a geometric graph. If no path of length at most $k$ in a geometric graph $G$ is self-intersecting we call $G$ $k$-locally plane. The main result of this paper is a construction…

We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes. We insist on straight-line edges and crossing-free drawings. This problem has many connections…

Motivated by a question of Erd\H{o}s on blocking sets in a projective plane that intersect every line only a few times, several authors have used unions of algebraic curves to construct such sets in $\mathbb{P}^2(\mathbb{F}_q)$. In this…

A new way to define the notion of $\C$-orthocenter will be displayed by studying some propierties of four points in the plane which allows to extend the notion of Euler's line, the Six Point Circles and the three-circles theorem, for normed…

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": $\|…

We classify the solutions to an overdetermined elliptic problem in the plane in the finite connectivity case. This is achieved by establishing a one-to-one correspondence between the solutions to this problem and a certain type of minimal…

The classification of shapes is of great interest in diverse areas ranging from medical imaging to computer vision and beyond. While many statistical frameworks have been developed for the classification problem, most are strongly tied to…

A central question in the study of line arrangements in the complex projective plane $\mathbb{CP}^2$ is: when does the combinatorial data of the arrangement determine its topological properties? In the present work, we introduce a…